8486 search results - page 423 / 1698 » Ordered Enumeration Method |
170
click to vote
AAAI
1994
15 years 9 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
199
click to vote
COLING
1996
15 years 9 months ago
1996
In this paper, we propose a statistical approach for clustering of artMes using on-line dictionary definitions. One of the characteristics of our approach is that every sense of w...
166
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We investigate planning for self-interested agents in large multi-agent simulations. We present two heuristic algorithms that exploit different domain-specific properties in order...
180
click to vote
ANOR
2007
15 years 7 months ago
2007
We present a new implementation of a widely used swap-based local search procedure for the p-median problem, proposed in 1968 by Teitz and Bart. Our method produces the same outpu...
197
click to vote
DM
2010
15 years 7 months ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...