Sciweavers

5263 search results - page 148 / 1053
» Open Constraint Optimization
Sort
View
118
Voted
ICRA
2010
IEEE
154views Robotics» more  ICRA 2010»
15 years 2 months ago
Multi-agent path planning with multiple tasks and distance constraints
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
Subhrajit Bhattacharya, Maxim Likhachev, Vijay Kum...
109
Voted
ICCAD
2004
IEEE
115views Hardware» more  ICCAD 2004»
16 years 18 days ago
Gate sizing for crosstalk reduction under timing constraints by Lagrangian relaxation
Abstract— This paper presents a post-route, timingconstrained gate-sizing algorithm for crosstalk reduction. Gate-sizing has emerged as a practical and feasible method to reduce ...
Debjit Sinha, Hai Zhou
122
Voted
ISSS
2000
IEEE
94views Hardware» more  ISSS 2000»
15 years 8 months ago
A Transformational Approach to Constraint Relaxation of a Time-driven Simulation Model
Time-driven simulation models typically model timing in an idealized way that is over-constrained and cannot be directly implemented. In this paper we present a transformation to ...
Marek Jersak, Ying Cai, Dirk Ziegenbein, Rolf Erns...
129
Voted
AIEDAM
2006
95views more  AIEDAM 2006»
15 years 3 months ago
Constraint solving for direct manipulation of features
In current commercial feature modeling systems, support for direct manipulation of features is not commonly available. This is partly due to the strong reliance of such systems on...
Daniel Lourenço, Pedro Oliveira, Alex Noort...
126
Voted
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
Random subcubes as a toy model for constraint satisfaction problems
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the s...
Thierry Mora, Lenka Zdeborová