Sciweavers

330 search results - page 58 / 66
» Diagnosing and Solving Over-Determined Constraint Satisfacti...
Sort
View
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 12 days ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
Robert M. Fuhrer, Steven M. Nowick
ECAI
1992
Springer
13 years 11 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
ATAL
2005
Springer
14 years 1 months ago
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
Syed Muhammad Ali, Sven Koenig, Milind Tambe
AI
1998
Springer
14 years 10 days ago
A Heuristic Incremental Modeling Approach to Course Timetabling
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...
Don Banks, Peter van Beek, Amnon Meisels
CP
1998
Springer
14 years 9 days ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow