3946 search results - page 94 / 790 » The computational complexity of choice sets |
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
113
click to vote
WG
2009
Springer
15 years 6 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
ICTCS
2005
Springer
15 years 5 months ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
204
click to vote
SIGMOD
2005
ACM
16 years 20 hour ago
2005
ACM
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
110
click to vote
SIGGRAPH
1991
ACM
15 years 3 months ago
1991
ACM
CT This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphic...