Sciweavers

2725 search results - page 365 / 545
» Constraint Solving for Interpolation
Sort
View
IROS
2008
IEEE
121views Robotics» more  IROS 2008»
15 years 11 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
PIMRC
2008
IEEE
15 years 11 months ago
An optimization framework for the joint routing and scheduling in Wireless Mesh Networks
—In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks dedicated to Internet access. Routing and transmission scheduling have a majo...
Christelle Molle, Fabrice Peix, Hervé Rivan...
CLUSTER
2007
IEEE
15 years 11 months ago
Scalable, fault-tolerant management of Grid Services
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
Harshawardhan Gadgil, Geoffrey Fox, Shrideep Palli...
IAT
2007
IEEE
15 years 11 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
148
Voted
ICC
2007
IEEE
139views Communications» more  ICC 2007»
15 years 11 months ago
Optimal Power Allocation for Amplify-And-Forward Relay Networks via Conic Programming
— Relay power allocation has been shown to provide substantial performance gain in wireless relay channels when perfect global channel state information (CSI) is available. In th...
Tony Q. S. Quek, Moe Z. Win, Hyundong Shin, Marco ...