1381 search results - page 106 / 277 » Computational Complexity of Constraint Satisfaction |
166
click to vote
LPNMR
1997
Springer
15 years 8 months ago
1997
Springer
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
144
click to vote
LATIN
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
108
click to vote
PPL
2010
15 years 2 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
139
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
A recurring problem in data centres is that the constantly changing workload is not proportionally distributed over the available servers. Some resources may lay idle while others ...
131
click to vote
MOBICOM
2005
ACM
15 years 10 months ago
2005
ACM
This paper is a contribution to the generic problem of having simple and accurate models to dimension radio cells with data traffic on a GPRS or EDGE network. It addresses the iss...