1041 search results - page 17 / 209 » Randomizing Reductions of Search Problems |
129
Voted
AMAI
1999
Springer
15 years 2 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
122
Voted
ETFA
2008
IEEE
15 years 4 months ago
2008
IEEE
In factory automation, production line scheduling entails a number of competing issues. Finding optimal configurations often requires use of local search techniques. Local search l...
107
Voted
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
127
Voted
MOBICOM
2004
ACM
15 years 8 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
119
Voted
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...