Sciweavers

14518 search results - page 2812 / 2904
» Two Problems for Sophistication
Sort
View
ICDE
2010
IEEE
167views Database» more  ICDE 2010»
13 years 10 months ago
Top-k pipe join
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
Davide Martinenghi, Marco Tagliasacchi
ADHOC
2010
195views more  ADHOC 2010»
13 years 10 months ago
SDRT: A reliable data transport protocol for underwater sensor networks
In this paper, we investigate the reliable data transport problem in underwater sensor networks. Underwater sensor networks are significantly different from terrestrial sensor net...
Peng Xie, Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zh...
AI
2008
Springer
13 years 10 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
ALMOB
2008
131views more  ALMOB 2008»
13 years 10 months ago
Fast algorithms for computing sequence distances by exhaustive substring composition
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
Alberto Apostolico, Olgert Denas
AMAI
2008
Springer
13 years 10 months ago
Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
Patrick Amstutz, Nikolaus Correll, Alcherio Martin...
« Prev « First page 2812 / 2904 Last » Next »