Sciweavers

1102 search results - page 71 / 221
» Dynamic Constraint Models for Planning and Scheduling Proble...
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 6 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
DATE
2009
IEEE
147views Hardware» more  DATE 2009»
14 years 3 months ago
Decoupling capacitor planning with analytical delay model on RLC power grid
— Decoupling capacitors (decaps) are typically used to reduce the noise in the power supply network. Because the delay of gates and interconnects is affected by the supply voltag...
Ye Tao, Sung Kyu Lim
AMAI
1999
Springer
13 years 8 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ADC
2006
Springer
135views Database» more  ADC 2006»
14 years 3 months ago
Using a temporal constraint network for business process execution
Business process management (BPM) has emerged as a dominant technology in current enterprise systems and business solutions. However, the technology continues to face challenges i...
Ruopeng Lu, Shazia Wasim Sadiq, Vineet Padmanabhan...
JUCS
2002
89views more  JUCS 2002»
13 years 8 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales