4372 search results - page 147 / 875 » Algorithmic Theories of Everything |
139
click to vote
SIGACT
2010
15 years 4 months ago
2010
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
142
click to vote
GECCO
2007
Springer
16 years 6 days ago
2007
Springer
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
151
Voted
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
149
click to vote
NAACL
2004
15 years 7 months ago
2004
We propose a theory that gives formal semantics to word-level alignments defined over parallel corpora. We use our theory to introduce a linear algorithm that can be used to deriv...
141
click to vote
ECCC
2007
15 years 6 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...