Sciweavers

23119 search results - page 275 / 4624
» From Domain to Requirements
Sort
View
JFPLC
2004
15 years 8 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
ENTCS
2002
78views more  ENTCS 2002»
15 years 6 months ago
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
INFOCOM
2010
IEEE
15 years 4 months ago
Measuring Availability in the Domain Name System
Abstract--The domain name system (DNS) is critical to Internet functionality. The availability of a domain name refers to its ability to be resolved correctly. We develop a model f...
Casey T. Deccio, Jeff Sedayao, Krishna Kant, Prasa...
AGP
1997
IEEE
15 years 11 months ago
Structural Information Analysis for CLP Languages
We present the rational construction of a generic domain for structural analysis anguages: Pattern(D ), where the parameter D is an abstract domain satisfying certain properties. ...
Roberto Bagnara