Sciweavers

1142 search results - page 152 / 229
» Approximability of Clausal Constraints
Sort
View
ICRA
2005
IEEE
106views Robotics» more  ICRA 2005»
15 years 12 months ago
A Fast Online Gait Planning with Boundary Condition Relaxation for Humanoid Robots
— A fast online gait planning method is proposed. Based on an approximate dynamical biped model whose mass is concentrated to COG, general solution of the equation of motion is a...
Tomomichi Sugihara, Yoshihiko Nakamura
IMR
2004
Springer
15 years 11 months ago
Smoothing and Adaptive Redistribution for Grids with Irregular Valence and Hanging Nodes
We describe some extensions to the grid smoothing scheme described in [1, 2] that deal with the following issues: 1) the clustering effect of changing valence in an unstructured ...
Larisa Branets, Graham F. Carey
SWAT
2004
Springer
142views Algorithms» more  SWAT 2004»
15 years 11 months ago
Getting the Best Response for Your Erg
We consider the speed scaling problem of minimizing the average response time of a collection of dynamically released jobs subject to a constraint A on energy used. We propose an ...
Kirk Pruhs, Patchrawat Uthaisombut, Gerhard J. Woe...
INFOCOM
2003
IEEE
15 years 11 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
CSCLP
2003
Springer
15 years 11 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings