1368 search results - page 65 / 274 » Perfect Local Computability and Computable Simulations |
106
click to vote
IPPS
2000
IEEE
15 years 3 months ago
2000
IEEE
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
STACS
2009
Springer
15 years 6 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
WIOPT
2005
IEEE
15 years 4 months ago
2005
IEEE
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...
AAAI
2000
15 years 21 days ago
2000
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
ADHOCNOW
2009
Springer
15 years 14 days ago
2009
Springer
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...