817 search results - page 13 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
JEA
2008
13 years 8 months ago
2008
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
ACL
2010
13 years 6 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...
DC
2010
13 years 8 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
ESA
2006
Springer
14 years 8 days ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...