×

Found 1,151 Documents (Results 1–100)

100
MathJax

Optimization of a recursive conveyor by reduction to a constraint satisfaction problem. (English. Russian original) Zbl 1481.90173

Autom. Remote Control 82, No. 11, 1892-1906 (2021); translation from Avtom. Telemekh. 2021, No. 11, 75-93 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Piecewise linear valued constraint satisfaction problems with fixed number of variables. (English) Zbl 1481.90270

Gentile, Claudio (ed.) et al., Graphs and combinatorial optimization: from theory to applications. Proceedings of the 18th Cologne-Twente workshop on graphs and combinatorial optimization (CTW2020), online, September 14–16, 2020. Cham: Springer. AIRO Springer Ser. 5, 265-276 (2021).
MSC:  90C27 90C35
PDF BibTeX XML Cite
Full Text: DOI arXiv

An algebraic view on p-admissible concrete domains for lightweight description logics. (English) Zbl 07437042

Faber, Wolfgang (ed.) et al., Logics in artificial intelligence. 17th European conference, JELIA 2021, virtual event, May 17–20, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12678, 194-209 (2021).
MSC:  68T27
PDF BibTeX XML Cite
Full Text: DOI

Galois connections for patterns: an algebra of labelled graphs. (English) Zbl 1467.68176

Cochez, Michael (ed.) et al., Graph structures for knowledge representation and reasoning. 6th international workshop, GKR 2020, virtual event, September 5, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12640, 125-150 (2021).
PDF BibTeX XML Cite
Full Text: DOI

Combinatorial designs on constraint satisfaction problem (VRP). (English) Zbl 07392077

Castillo, Oscar (ed.) et al., Intuitionistic and type-2 fuzzy logic enhancements in neural and optimization algorithms: theory and applications. Cham: Springer. Stud. Comput. Intell. 862, 509-526 (2020).
MSC:  68T37
PDF BibTeX XML Cite
Full Text: DOI

On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width. (English) Zbl 07299525

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 958-971 (2020).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

Intermediate problems in modular circuits satisfiability. (English) Zbl 07299497

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 578-590 (2020).
MSC:  68-XX
PDF BibTeX XML Cite
Full Text: DOI arXiv

Temporal constraint satisfaction problems in fixed-point logic. (English) Zbl 07299472

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 237-251 (2020).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI arXiv

QCSP monsters and the demise of the Chen conjecture. (English) Zbl 07298233

Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM). 91-104 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Best-case and worst-case sparsifiability of Boolean CSPs. (English) Zbl 07378601

Paul, Christophe (ed.) et al., 13th international symposium on parameterized and exact computation, IPEC 2018, August 22–24, 2018, Helsinki, Finland. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 115, Article 15, 13 p. (2019).
MSC:  68Q25 68Wxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Algebraic approach to promise constraint satisfaction. (English) Zbl 1433.68271

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 602-613 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

CSPs with global modular constraints: algorithms and hardness via polynomial representations. (English) Zbl 1433.68270

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 590-601 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Bridging between 0/1 and linear programming via random walks. (English) Zbl 1433.68156

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 568-577 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

On the approximation resistance of balanced linear threshold functions. (English) Zbl 1433.68160

Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 430-441 (2019).
MSC:  68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Consistency for \(0-1\) programming. (English) Zbl 07116696

Rousseau, Louis-Martin (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11494, 225-240 (2019).
MSC:  68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI arXiv

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software