440 search results - page 28 / 88 » Local Search Heuristics for the Multidimensional Assignment ... |
GECCO
2003
Springer
14 years 27 days ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
JAIR
2006
13 years 7 months ago
2006
Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning prob...
ICTAI
2003
IEEE
14 years 29 days ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
AAAI
1997
13 years 9 months ago
1997
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
: A local search algorithm operating on an instance of a Boolean constraint satisfaction problem (in particular, k-SAT) can be viewed as a stochastic process traversing successive ...