1197 search results - page 43 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CDC
2010
IEEE
13 years 4 months ago
2010
IEEE
The problem of making a bicycle trace a strictly convex Jordan curve with bounded roll angle and bounded speed is investigated. The problem is solved by enforcing a virtual holonom...
ICRA
2009
IEEE
13 years 7 months ago
2009
IEEE
A Riemannian-geometry approach for control and stabilization of dynamics of object manipulation under holonomic or non-holonomic (but Pfaffian) constraints is presented. First, pos...
CP
2006
Springer
14 years 29 days ago
2006
Springer
This paper presents an enumerative approach for a sports league scheduling problem. This simple method can solve some instances involving a number T of teams up to 70 while the bes...
ENTCS
2008
13 years 9 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...