10988 search results - page 372 / 2198 » Algorithmic Folding Complexity |
138
click to vote
ECAI
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
165
click to vote
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
135
Voted
COCO
2010
Springer
15 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
124
click to vote
ICWN
2003
15 years 6 months ago
2003
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
171
click to vote
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
14 years 12 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...