Sciweavers

9119 search results - page 214 / 1824
» A Simultaneous Search Problem
Sort
View
AAAI
2000
15 years 7 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
KI
2007
Springer
16 years 20 days ago
A Stochastic Local Search Approach to Vertex Cover
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
Silvia Richter, Malte Helmert, Charles Gretton
SAGA
2001
Springer
15 years 11 months ago
Yet Another Local Search Method for Constraint Solving
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
Philippe Codognet, Daniel Diaz
DAM
2008
135views more  DAM 2008»
15 years 6 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
ICTAI
2010
IEEE
15 years 4 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...