×

Found 342 Documents (Results 1–100)

Partition crossover can linearize local optima lattices of k-bounded pseudo-Boolean functions. (English) Zbl 07809173

Chicano, Francisco (ed.) et al., Proceedings of the 17th ACM/SIGEVO workshop on foundations of genetic algorithms, FOGA 2023, Potsdam, Germany, August 30 – September 1, 2023. New York, NY: Association for Computing Machinery (ACM). 152-162 (2023).
MSC:  68T20 68W50 90C59
PDFBibTeX XMLCite
Full Text: DOI

Virtual pairwise consistency in cost function networks. (English) Zbl 07745675

Cire, Andre A. (ed.), Integration of constraint programming, artificial intelligence, and operations research. 20th international conference, CPAIOR 2023, Nice, France, May 29 – June 1, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13884, 417-426 (2023).
MSC:  68T20 90Bxx 90C27
PDFBibTeX XMLCite
Full Text: DOI

On Monte Carlo tree search for weighted vertex coloring. (English) Zbl 1499.68273

Pérez Cáceres, Leslie (ed.) et al., Evolutionary computation in combinatorial optimization. 22nd European conference, EvoCOP 2022, held as part of EvoStar 2022, Madrid, Spain, April 20–22, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13222, 1-16 (2022).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Evidence for long-tails in SLS algorithms. (English) Zbl 07740937

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 82, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Interactive optimization of submodular functions under matroid constraints. (English) Zbl 07670914

Fotakis, Dimitris (ed.) et al., Algorithmic decision theory. 7th international conference, ADT 2021, Toulouse, France, November 3–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13023, 307-322 (2021).
PDFBibTeX XMLCite
Full Text: DOI

Efficient local search for pseudo Boolean optimization. (English) Zbl 07495583

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 332-348 (2021).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI

Solving non-uniform planted and filtered random SAT formulas greedily. (English) Zbl 07495573

Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 188-206 (2021).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI

Stagnation detection with randomized local search. (English) Zbl 1474.68477

Zarges, Christine (ed.) et al., Evolutionary computation in combinatorial optimization. 21st European conference, EvoCOP 2021, held as part of EvoStar 2021, virtual event, April 7–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12692, 152-168 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Visualizing local minima in multi-robot motion planning using multilevel Morse theory. (English) Zbl 1469.68131

Lavalle, Steven M. (ed.) et al., Algorithmic foundations of robotics XIV. Proceedings of the fourteenth workshop on the algorithmic foundations of robotics. Cham: Springer. Springer Proc. Adv. Robot. 17, 502-517 (2021).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Effect of initial assignment on local search performance for Max Sat. (English) Zbl 1515.68286

Faro, Simone (ed.) et al., 18th international symposium on experimental algorithms, SEA 2020, Catania, Italy, June 16–18, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 160, Article 8, 14 p. (2020).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Relaxation-aware heuristics for exact optimization in graphical models. (English) Zbl 07636038

Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 475-491 (2020).
MSC:  68T20 90Bxx 90C27
PDFBibTeX XMLCite
Full Text: DOI

Improving a branch-and-bound approach for the degree-constrained minimum spanning tree problem with LKH. (English) Zbl 07636036

Hebrard, Emmanuel (ed.) et al., Integration of constraint programming, artificial intelligence, and operations research. 17th international conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12296, 447-456 (2020).
MSC:  68T20 90Bxx 90C27
PDFBibTeX XMLCite
Full Text: DOI

Cooperative parallel SAT local search with path relinking. (English) Zbl 1484.68218

Paquete, Luís (ed.) et al., Evolutionary computation in combinatorial optimization. 20th European conference, EvoCOP 2020, held as part of EvoStar 2020, Seville, Spain, April 15–17, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12102, 83-98 (2020).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

On the effect of learned clauses on stochastic local search. (English) Zbl 07331014

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 89-106 (2020).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Declarative local search for predicate logic. (English) Zbl 1522.68518

Balduccini, Marcello (ed.) et al., Logic programming and nonmonotonic reasoning. 15th international conference, LPNMR 2019, Philadelphia, PA, USA, June 3–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11481, 340-346 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Constraint programming for high school timetabling: a scheduling-based model with hot starts. (English) Zbl 1490.68203

van Hoeve, Willem-Jan (ed.), Integration of constraint programming, artificial intelligence, and operations research. 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10848, 135-152 (2018).
MSC:  68T20 90B35 90C27
PDFBibTeX XMLCite
Full Text: DOI

On efficiently solvable cases of quantum \(k\)-SAT. (English) Zbl 1512.68099

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 38, 16 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Chain, generalization of covering code, and deterministic algorithm for \(k\)-SAT. (English) Zbl 1499.68382

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 88, 13 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

How perturbation strength shapes the global structure of TSP fitness landscapes. (English) Zbl 1423.90233

Liefooghe, Arnaud (ed.) et al., Evolutionary computation in combinatorial optimization. 18th European conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10782, 34-49 (2018).
MSC:  90C27 68T20 90C59
PDFBibTeX XMLCite
Full Text: DOI Link

On the fractal nature of local optima networks. (English) Zbl 1423.90239

Liefooghe, Arnaud (ed.) et al., Evolutionary computation in combinatorial optimization. 18th European conference, EvoCOP 2018, Parma, Italy, April 4–6, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10782, 18-33 (2018); erratum ibid. 10782, E1 (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Reasoning on sequences in constraint-based local search frameworks. (English) Zbl 1508.68325

van Hoeve, Willem-Jan (ed.), Integration of constraint programming, artificial intelligence, and operations research. 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10848, 117-134 (2018).
MSC:  68T20 68P05 90C35
PDFBibTeX XMLCite
Full Text: DOI

Collective singleton-based consistency for qualitative constraint networks. (English) Zbl 1515.68293

Schewe, Sven (ed.) et al., 24th international symposium on temporal representation and reasoning, TIME 2017, Mons, Belgium, October 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 90, Article 19, 17 p. (2017).
MSC:  68T20
PDFBibTeX XMLCite
Full Text: DOI

Metaheuristics for score-and-search Bayesian network structure learning. (English) Zbl 1441.68228

Mouhoub, Malek (ed.) et al., Advances in artificial intelligence. 30th Canadian conference on artificial intelligence, Canadian AI 2017, Edmonton, AB, Canada, May 16–19, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10233, 129-141 (2017).
MSC:  68T20 62H22 68T05
PDFBibTeX XMLCite
Full Text: DOI

Stability and recovery for independence systems. (English) Zbl 1442.68263

Pruhs, Kirk (ed.) et al., 25th European symposium on algorithms, ESA 2017, Vienna, Austria, September 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 87, Article 26, 15 p. (2017).
MSC:  68W25 68T20 90C59
PDFBibTeX XMLCite
Full Text: DOI arXiv

Orbits of algebraic dynamical systems in subgroups and subfields. (English) Zbl 1393.37113

Elsholtz, Christian (ed.) et al., Number theory – Diophantine problems, uniform distribution and applications. Festschrift in honour of Robert F. Tichy’s 60th birthday. Cham: Springer (ISBN 978-3-319-55356-6/hbk; 978-3-319-55357-3/ebook). 347-368 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Turbocharging treewidth heuristics. (English) Zbl 1398.68490

Guo, Jiong (ed.) et al., 11th international symposium on parameterized and exact computation (IPEC 2016), Aarhus, Denmark, August 24–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-023-1). LIPIcs – Leibniz International Proceedings in Informatics 63, Article 13, 13 p. (2017).
MSC:  68T20 68Q17 68Q25
PDFBibTeX XMLCite
Full Text: DOI

How well do local algorithms solve semidefinite programs? (English) Zbl 1369.90118

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 604-614 (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

In search of balance: the challenge of generating balanced Latin rectangles. (English) Zbl 1489.68251

Salvagnin, Domenico (ed.) et al., Integration of AI and OR techniques in constraint programming. 14th international conference, CPAIOR 2017, Padua, Italy, June 5–8, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10335, 68-76 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software