14548 search results - page 208 / 2910 » The Optimal Path-Matching Problem |
109
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
101
Voted
LATIN
2000
Springer
15 years 4 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
83
Voted
SIAMSC
2008
15 years 15 days ago
2008
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
117
Voted
GPEM
2002
15 years 11 days ago
2002
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
119
click to vote
NECO
1998
15 years 7 days ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...