Sciweavers

251 search results - page 28 / 51
» Distributed algorithms for edge dominating sets
Sort
View
CIKM
2009
Springer
15 years 6 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
JAIR
2008
103views more  JAIR 2008»
14 years 11 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
BMCBI
2007
104views more  BMCBI 2007»
14 years 11 months ago
A response to Yu et al. "A forward-backward fragment assembling algorithm for the identification of genomic amplification and de
Background: Yu et al. (BMC Bioinformatics 2007,8: 145+) have recently compared the performance of several methods for the detection of genomic amplification and deletion breakpoin...
Oscar M. Rueda, Ramón Díaz-Uriarte
ICCS
2005
Springer
15 years 5 months ago
PATM: Priority-Based Adaptive Topology Management for Efficient Routing in Ad Hoc Networks
Abstract. We propose a distributed and adaptive topology management algorithm, called PATM (Priority-based Adaptive Topology Management), that constructs and maintains a connected ...
Haixia Tan, Weilin Zeng, Lichun Bao
ATAL
2006
Springer
15 years 3 months ago
Distributed navigation in an unknown physical environment
We address the problem of navigating from an initial node to a goal node by a group of agents in an unknown physical environment. In such environments mobile agents must physicall...
Arnon Gilboa, Amnon Meisels, Ariel Felner