6274 search results - page 818 / 1255 » Proofs, Programs, Processes |
191
Voted
COLING
1996
15 years 8 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
182
click to vote
CEC
2010
IEEE
15 years 8 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
168
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
152
click to vote
ADCM
2010
15 years 7 months ago
2010
The local reconstruction from samples is one of most desirable properties for many applications in signal processing, but it has not been given as much attention. In this paper, we...
171
click to vote
ALMOB
2007
15 years 7 months ago
2007
Background: Neighbor-Net is a novel method for phylogenetic analysis that is currently being widely used in areas such as virology, bacteriology, and plant evolution. Given an inp...