601 search results - page 19 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
160
click to vote
SARA
2007
Springer
16 years 19 days ago
2007
Springer
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...
175
click to vote
ADHOCNOW
2008
Springer
16 years 26 days ago
2008
Springer
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 ...
173
click to vote
ACL
1990
15 years 7 months ago
1990
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...
152
click to vote
CP
2005
Springer
16 years 1 days ago
2005
Springer
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...
170
click to vote
IAAI
2001
15 years 8 months ago
2001
ADIOP is an application for Automated Diagnosis of InterOperability Problems. Interoperability testing involves checking the degree of compatibility between two networking devices...