Sciweavers

330 search results - page 47 / 66
» Approximation Algorithms for the Directed k-Tour and k-Strol...
Sort
View
ICRA
2005
IEEE
135views Robotics» more  ICRA 2005»
14 years 1 months ago
Sampling-Based Motion Planning Using Predictive Models
— Robotic motion planning requires configuration space exploration. In high-dimensional configuration spaces, a complete exploration is computationally intractable. Practical m...
Brendan Burns, Oliver Brock
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
14 years 1 months ago
Morphing methods in evolutionary design optimization
Design optimization is a well established application field of evolutionary computation. However, standard recombination operators acting on the genotypic representation of the d...
Michael Nashvili, Markus Olhofer, Bernhard Sendhof...
CVPR
2010
IEEE
14 years 3 months ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 8 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 23 days ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun