Sciweavers

1350 search results - page 231 / 270
» Generalized Committed Choice
Sort
View
COCOA
2007
Springer
15 years 6 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
15 years 6 months ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 6 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...
ICMI
2007
Springer
138views Biometrics» more  ICMI 2007»
15 years 6 months ago
Speech-filtered bubble ray: improving target acquisition on display walls
The rapid development of large interactive wall displays has been accompanied by research on methods that allow people to interact with the display at a distance. The basic method...
Edward Tse, Mark S. Hancock, Saul Greenberg
TARK
2007
Springer
15 years 6 months ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh