2069 search results - page 396 / 414 » Linear time algorithms for Clobber |
171
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
154
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
The Building Block Hypothesis suggests that Genetic Algorithms (GAs) are well-suited for hierarchical problems, where efficient solving requires proper problem decomposition and a...
193
click to vote
ATVA
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Model-checking alternating-time properties has recently attracted much interest in the verification of distributed protocols. While checking the validity of a specificati...
184
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
140
click to vote
CPM
2006
Springer
15 years 9 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...