Sciweavers

270 search results - page 38 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
AIPS
2009
13 years 8 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
CGF
2008
227views more  CGF 2008»
13 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
GECCO
2004
Springer
14 years 1 months ago
Real-Coded Bayesian Optimization Algorithm: Bringing the Strength of BOA into the Continuous World
This paper describes a continuous estimation of distribution algorithm (EDA) to solve decomposable, real-valued optimization problems quickly, accurately, and reliably. This is the...
Chang Wook Ahn, Rudrapatna S. Ramakrishna, David E...
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
13 years 12 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
JIFS
2006
120views more  JIFS 2006»
13 years 7 months ago
Building similarity metrics reflecting utility in case-based reasoning
Fundamental to case-based reasoning is the idea that similar problems have similar solutions. The meaning of the concept of "similarity" can vary in different situations...
Ning Xiong, Peter Funk