2609 search results - page 152 / 522 » Models for Global Constraint Applications |
163
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
188
click to vote
AAAI
2000
15 years 7 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
183
click to vote
INFORMATICALT
2002
15 years 6 months ago
2002
In this paper, we present our Form-driven approach for reverse engineering of relationa databases. This methodology uses the information extracted from both form structure and inst...
196
click to vote
CSCLP
2006
Springer
15 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
190
click to vote
TSP
2010
15 years 1 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...