Sciweavers

940 search results - page 145 / 188
» Control Abstractions for Local Search
Sort
View
SAC
2004
ACM
14 years 1 months ago
Solving the error correcting code problem with parallel hybrid heuristics
Some telecommunication systems can not afford the cost of repeating a corrupted message. Instead, the message should be somewhat “corrected” by the receiver. In these cases a...
Enrique Alba, J. Francisco Chicano
ICRA
2003
IEEE
146views Robotics» more  ICRA 2003»
14 years 1 months ago
Dispersion behaviors for a team of multiple miniature robots
To safely and efficiently guide search and rescue operations in disaster areas, gathering of relevant information such as the locations of victims, must occur swiftly. Using the c...
Janice L. Pearce, Paul E. Rybski, Sascha Stoeter, ...
SI3D
2003
ACM
14 years 1 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
AIPS
2008
13 years 10 months ago
A Probabilistic Planner for the Combat Power Management Problem
We present a planner for the Combat Power Management (CPM) problem. In response to multiple simultaneous or sequential threats, the planner generates a set of local plans, one for...
Abder Rezak Benaskeur, Froduald Kabanza, Eric Beau...
CEC
2007
IEEE
13 years 10 months ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki