Sciweavers

1984 search results - page 112 / 397
» The colourful feasibility problem
Sort
View
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
15 years 12 months ago
Online ZMP sampling search for biped walking planning
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
Jinsu Liu, Manuela M. Veloso
VTC
2007
IEEE
130views Communications» more  VTC 2007»
15 years 11 months ago
Automated Up- and Downlink Capacity Balancing in WCDMA Networks
— Dynamic optimization of UMTS systems has been gaining a growing interest by the research community. In this context, the current paper concentrates on dynamic automated tuning ...
Mario García-Lozano, Oriol Sallent, Jordi P...
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
15 years 10 months ago
Power Constrained High-Level Synthesis of Battery Powered Digital Systems
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
S. F. Nielsen, Jan Madsen
ECRTS
2003
IEEE
15 years 10 months ago
Resource Partitioning among Real-Time Applications
When executing different real-time applications on a single processor system, one problem is how to compose these applications and guarantee at the same time that their timing req...
Giuseppe Lipari, Enrico Bini
PODC
2003
ACM
15 years 10 months ago
Automatic discovery of mutual exclusion algorithms
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known ...
Yoah Bar-David, Gadi Taubenfeld