3353 search results - page 452 / 671 » Laver and set theory |
188
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
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...
200
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
195
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
128
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
212
click to vote
GC
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...