Sciweavers

711 search results - page 58 / 143
» Amalgams of Constraint Satisfaction Problems
Sort
View
IAAI
2001
15 years 5 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
CP
2004
Springer
15 years 10 months ago
Leveraging the Learning Power of Examples in Automated Constraint Acquisition
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
Christian Bessière, Remi Coletta, Eugene C....
138
Voted
CDB
2004
Springer
143views Database» more  CDB 2004»
15 years 10 months ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
AAAI
2000
15 years 5 months ago
Asynchronous Search with Aggregations
Many problem-solving tasks can be formalized as constraint satisfaction problems (CSPs). In a multi-agent setting, information about constraints and variables may belong to differ...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
132
Voted
WG
2004
Springer
15 years 10 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano