Sciweavers

601 search results - page 19 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
76
Voted
SARA
2007
Springer
15 years 3 months ago
Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
Ian P. Gent, Ian Miguel, Andrea Rendl
ADHOCNOW
2008
Springer
15 years 3 months ago
Request Satisfaction Problem in Synchronous Radio Networks
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
Benoît Darties, Sylvain Durand, Jér&o...
ACL
1990
14 years 10 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
CP
2005
Springer
15 years 3 months ago
Encoding HTN Planning as a Dynamic CSP
Abstract. Constraint satisfaction problems provide strong formalism for modeling variety of real life problems. This paper presents a work currently in progress of which the goal i...
Pavel Surynek, Roman Barták
IAAI
2001
14 years 10 months ago
Constraint-Based Modeling of InterOperability Problems Using an Object-Oriented Approach
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...
Mohammed H. Sqalli, Eugene C. Freuder