Sciweavers

17 search results - page 3 / 4
» Making constraint solvers more usable: overconstraint proble...
Sort
View
ECAI
2008
Springer
13 years 9 months ago
A BDD Approach to the Feature Subscription Problem
Modern feature-rich telecommunications services offer significant opportunities to human users. To make these services more usable, facilitating personalisation is very important s...
Tarik Hadzic, David Lesaint, Deepak Mehta, Barry O...
JNSM
2008
130views more  JNSM 2008»
13 years 7 months ago
Declarative Infrastructure Configuration Synthesis and Debugging
There is a large conceptual gap between end-to-end infrastructure requirements and detailed component configuration implementing those requirements. Today, this gap is manually br...
Sanjai Narain, Gary Levin, Sharad Malik, Vikram Ka...
AIIDE
2006
13 years 8 months ago
Lightweight Simulation of Air Traffic Control Using Simple Temporal Networks
Flight simulators are becoming more sophisticated and realistic, and the requirements of those using them are becoming more demanding. Air traffic control simulation for such simu...
Russell Knight
ECAI
2004
Springer
13 years 11 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
IAT
2003
IEEE
14 years 20 days ago
Problem-solving in open environments
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
Santiago Macho-Gonzalez, Boi Faltings