129 search results - page 13 / 26 » Optimal solutions for moving target search |
IJRR
2010
14 years 9 months ago
2010
We present an anytime algorithm for coordinating multiple autonomous searchers to find a potentially adversarial target on a graphical representation of a physical environment. Th...
IUI
2004
ACM
15 years 5 months ago
2004
ACM
The goal of this work is to provide users immersed in a multi-platform environment with the possibility of interacting with an application while freely moving from one device to a...
BMCBI
2010
14 years 12 months ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
100
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
WSC
2007
15 years 2 months ago
2007
This paper describes an innovative framework, iFAOSimo, which integrates optimization, simulation and GIS (geographic information system) techniques to handle complex spatial faci...