Sciweavers

1104 search results - page 98 / 221
» Experimental evaluation of optimal CSMA
Sort
View
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 5 months ago
SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases
— A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage o...
Dan Olteanu, Jiewen Huang, Christoph Koch
INFOCOM
2007
IEEE
14 years 4 months ago
Performance Comparison of Detection Schemes for MAC Layer Misbehavior
— This paper revisits the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Se...
Alvaro A. Cárdenas, Svetlana Radosavac, Joh...
JAIR
2008
110views more  JAIR 2008»
13 years 10 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
AICOM
2005
91views more  AICOM 2005»
13 years 10 months ago
Multiagent systems for cardiac pacing simulation and control
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
Francesco Amigoni, Alessandro Beda, Nicola Gatti
CIKM
2011
Springer
12 years 10 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...