2252 search results - page 162 / 451 » Lower Bounds for Dynamic Algorithms |
156
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
148
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Recently, the maximum likelihood estimator (MLE) and Cramer-Rao Lower Bound (CRLB) were proposed with the goal of maximizing and assessing the synchronization accuracy in wireless...
127
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
124
click to vote
JAIR
2008
15 years 3 months ago
2008
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
147
Voted
NETWORKING
2010
15 years 5 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...