Sciweavers

955 search results - page 67 / 191
» A System for Solving Constraint Satisfaction Problems with S...
Sort
View
FOCI
2007
IEEE
14 years 2 months ago
A New Reduction from 3SAT to n-Partite Graphs
— The Constraint Satisfaction Problem (CSP) is one of the most prominent problems in artificial intelligence, logic, theoretical computer science, engineering and many other are...
Daniel J. Hulme, Robin Hirsch, Bernard F. Buxton, ...
AAAI
1996
13 years 9 months ago
A Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
Kalev Kask, Rina Dechter
IJCAI
2003
13 years 9 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
14 years 2 months ago
Tool-support for the analysis of hybrid systems and models
This paper introduces a method and tool-support for the automatic analysis and verification of hybrid and embedded control systems, whose continuous dynamics are often modelled u...
Andreas Bauer 0002, Markus Pister, Michael Tautsch...
AAAI
2004
13 years 9 months ago
The U.S. National Football League Scheduling Problem
We describe the problem of scheduling the television broadcasts of the U.S. National Football League (NFL). Unlike traditional round-robin tournament scheduling, the NFL problem i...
Bistra N. Dilkina, William S. Havens