Sciweavers

1242 search results - page 87 / 249
» The Theory of Grammar Constraints
Sort
View
INFOCOM
2010
IEEE
15 years 4 months ago
An Axiomatic Theory of Fairness in Network Resource Allocation
We present a set of five axioms for fairness measures in resource allocation. A family of fairness measures satisfying the axioms is constructed. Well-known notions such as -fairne...
Tian Lan, David Kao, Mung Chiang, Ashutosh Sabharw...
ICALP
2007
Springer
16 years 13 days ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
CSR
2008
Springer
15 years 6 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 10 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
ECAI
2010
Springer
15 years 7 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...