202 search results - page 15 / 41 » Complexity of local search for the p-median problem |
ECAI
2000
Springer
13 years 11 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...
ECAI
2004
Springer
14 years 24 days ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
JSAC
2008
13 years 7 months ago
2008
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
CPE
1997
Springer
13 years 11 months ago
1997
Springer
We consider the problem of storing and searching a large state space obtained from a high-level model such as a queueing network or a Petri net. After reviewing the traditional te...
GECCO
2005
Springer
14 years 28 days ago
2005
Springer
The well-known Griewangk function, used for evaluation of evolutionary algorithms, becomes easier as the number of dimensions grows. This paper suggests three alternative implemen...