Sciweavers

1421 search results - page 27 / 285
» Satisfying KBO Constraints
Sort
View
ICRA
2009
IEEE
108views Robotics» more  ICRA 2009»
13 years 5 months ago
On the generation of feasible paths for aerial robots with limited climb angle
This paper presents a methodology based on a variation of the Quintic Pythagorean Hodographs curves for generating smooth feasible paths for autonomous vehicles in three-dimensiona...
Armando Alves Neto, Mario Fernando Montenegro Camp...
JMLR
2012
11 years 10 months ago
Constrained 1-Spectral Clustering
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
Syama Sundar Rangapuram, Matthias Hein
AI
2004
Springer
14 years 1 months ago
Constraint Satisfaction Methods for Information Personalization
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
Syed Sibte Raza Abidi, Yong Han Chong
IJCAI
1993
13 years 9 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
AAAI
1994
13 years 9 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara