230 search results - page 4 / 46 » Constraint Orbital Branching |
IPCO
2007
13 years 7 months ago
2007
Consider an integer program max(ct x : Ax = b, x ≥ 0, x ∈ Zn ) where A ∈ Zm×n , b ∈ Zm , and c ∈ Zn . We show that the integer program can be solved in pseudo-polynomial...
CP
2008
Springer
13 years 7 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
ICRA
2010
IEEE
13 years 4 months ago
2010
IEEE
—Space exploitation will require efficient techniques for manipulating passive objects on orbit. This work presents a manipulation concept that utilizes both the on-off thruste...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents three feedback controllers that achieve an asymptotically stable, periodic, and fast walking gait for a 3D bipedal robot consisting of a torso, revolute knees, ...
AUSAI
2009
Springer
14 years 17 days ago
2009
Springer
Model checking games are instances of Hintikka’s game semantics for logic used for purposes of debugging systems verification models. Previous work in the area has developed the...