Did you mean: research

search result

Cover von Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)

Improving Local Search for Structured SAT Formulas via Unit Propagation Based Construct and Cut Initialization (Short Paper)

Year: 2021
Media group: LIPIcs
Cover von A Large-Scale Analysis of Mixed Initiative in Information-Seeking Dialogues for Conversational Search
article
Search for this author
Year: 2021
Publisher: Cornell University, arXiv.org
Media group: ARTICLE
Cover von Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs

Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs

Year: 2020
Media group: LIPIcs
Cover von Traditional Wisdom and Monte Carlo Tree Search Face-to-Face in the Card Game Scopone
article
Search for this author
Year: 2018
Publisher: Los Alamitos, IEEE
Series: IEEE Transactions on Games; 10. 2018, 3
Media group: ARTICLE
Cover von A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem

A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem

Year: 2018
Media group: OASICS
Cover von Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One

Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One

Year: 2016
Media group: LIPIcs
Cover von Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks

Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks

Year: 2015
Media group: OASICS
Cover von A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems

A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems

Year: 2021
Media group: LIPIcs
Cover von Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)

Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)

Year: 2020
Media group: LIPIcs
Cover von A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem

article
Author: Morabito, Reinaldo; Pureza, Vitoria
Year: 2010
Media group: ARTICLE
OPEN V 11.1.0.0