Sciweavers

1429 search results - page 216 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CEC
2008
IEEE
14 years 2 months ago
DEACO: Hybrid Ant Colony Optimization with Differential Evolution
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
Xiangyin Zhang, Haibin Duan, Jiqiang Jin
ICRA
2003
IEEE
118views Robotics» more  ICRA 2003»
14 years 29 days ago
Capturing a convex object with three discs
Abstract— This paper addresses the problem of capturing an arbitrary convex object P in the plane with three congruent disc-shaped robots. Given two stationary robots in contact ...
Jeff Erickson, Shripad Thite, Fred Rothganger, Jea...
ICRA
2000
IEEE
84views Robotics» more  ICRA 2000»
14 years 2 days ago
Enhancing Randomized Motion Planners: Exploring with Haptic Hints
In this paper, we investigate methods for enabling a human operator and an automatic motion planner to cooperatively solve a motion planning query. Our work is motivated by our ex...
O. Burçhan Bayazit, Guang Song, Nancy M. Am...
ALT
1997
Springer
13 years 12 months ago
Learning DFA from Simple Examples
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
Rajesh Parekh, Vasant Honavar
CONEXT
2005
ACM
13 years 9 months ago
Optimal positioning of active and passive monitoring devices
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
Claude Chaudet, Eric Fleury, Isabelle Guéri...