Sciweavers

2252 search results - page 99 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
PERCOM
2006
ACM
16 years 1 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece
COR
2007
183views more  COR 2007»
15 years 1 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 2 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
GECCO
2006
Springer
127views Optimization» more  GECCO 2006»
15 years 5 months ago
Multiobjective genetic algorithms for multiscaling excited state direct dynamics in photochemistry
This paper studies the effectiveness of multiobjective genetic and evolutionary algorithms in multiscaling excited state direct dynamics in photochemistry via rapid reparameteriza...
Kumara Sastry, D. D. Johnson, Alexis L. Thompson, ...
JAIR
2010
119views more  JAIR 2010»
15 years 21 hour ago
Active Tuples-based Scheme for Bounding Posterior Beliefs
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any ...
Bozhena Bidyuk, Rina Dechter, Emma Rollon