2252 search results - page 179 / 451 » Lower Bounds for Dynamic Algorithms |
130
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose the island model parallel memetic algorithm with diversity-based dynamic adaptive strategy (PMADLS) for controlling the local search frequency and demons...
127
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...
151
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
117
Voted
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...