Sciweavers

7522 search results - page 401 / 1505
» Spacing memetic algorithms
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 12 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
16 years 1 months ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
COLT
2005
Springer
16 years 1 months ago
Leaving the Span
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
Manfred K. Warmuth, S. V. N. Vishwanathan
3DPVT
2002
IEEE
108views Visualization» more  3DPVT 2002»
16 years 18 days ago
Probabilistic 3D Data Fusion for Adaptive Resolution Surface Generation
In this paper we present an algorithm for adaptive resolution integration of 3D data collected from multiple distributed sensors. The input to the algorithm is a set of 3D surface...
Andrew E. Johnson, Roberto Manduchi
ECAI
2008
Springer
15 years 9 months ago
Structure Learning of Markov Logic Networks through Iterated Local Search
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
Marenglen Biba, Stefano Ferilli, Floriana Esposito