Sciweavers

3406 search results - page 656 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 9 days ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
14 years 6 days ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
13 years 11 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith
JCIT
2008
138views more  JCIT 2008»
13 years 8 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan