1051 search results - page 161 / 211 » Foundations of Constraint Satisfaction |
FOCS
1992
IEEE
14 years 2 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
In this paper we look at the outage capacity of the fading relay channel with half-duplex constraint in the low SNR regime. First we consider the scenario that the channel state i...
PVLDB
2010
13 years 8 months ago
2010
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
CPAIOR
2009
Springer
14 years 4 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...