Sciweavers

858 search results - page 109 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
IJMC
2007
40views more  IJMC 2007»
13 years 7 months ago
Valuing wireless data services solutions for corporate clients using real options
: The paper deals with wireless data services and their importance in the enterprise world. Provisioning in difficult-to-reach areas of tall buildings is challenging. To extend cov...
William Ramirez, Fotios C. Harmantzis, Venkata Pra...
SAC
2006
ACM
13 years 7 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
IROS
2009
IEEE
154views Robotics» more  IROS 2009»
14 years 2 months ago
A control-based approach to task-constrained motion planning
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...
Giuseppe Oriolo, Marilena Vendittelli
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
14 years 2 days ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
CONSTRAINTS
2007
46views more  CONSTRAINTS 2007»
13 years 7 months ago
Local-search Extraction of MUSes
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
Éric Grégoire, Bertrand Mazure, C&ea...