4894 search results - page 726 / 979 » The Guarding Problem - Complexity and Approximation |
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
NIPS
2007
13 years 9 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
ADHOCNOW
2009
Springer
13 years 9 months ago
2009
Springer
We consider n mobile sensors located on a line containing a barrier represented by a finite line segment. Sensors form a wireless sensor network and are able to move within the lin...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...