Sciweavers

209 search results - page 27 / 42
» Decomposable Constraints
Sort
View
CP
2004
Springer
14 years 28 days ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
INFOCOM
2006
IEEE
14 years 1 months ago
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...
Lijun Chen, Steven H. Low, Mung Chiang, John C. Do...
RSS
2007
147views Robotics» more  RSS 2007»
13 years 9 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
SPAA
2005
ACM
14 years 1 months ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
CDC
2008
IEEE
103views Control Systems» more  CDC 2008»
13 years 8 months ago
Control of an pseudo-omnidirectional, non-holonomic, mobile robot based on an ICM representation in spherical coordinates
— For mobile platforms with steerable standard wheels it is necessary to precisely coordinate rotation and steering angle of their wheels. Especially for redundantly actuated pla...
Christian Pascal Connette, Andreas Pott, Martin H&...