Sciweavers

567 search results - page 106 / 114
» Probabilistic Reasoning With Answer Sets
Sort
View
ICDCS
2009
IEEE
15 years 6 months ago
On the Utility of Inference Mechanisms
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson
TISSEC
2008
235views more  TISSEC 2008»
14 years 9 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
QEST
2010
IEEE
14 years 7 months ago
Timed Branching Processes
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
Ashutosh Trivedi, Dominik Wojtczak
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
15 years 7 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
SIGECOM
2004
ACM
120views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Computational criticisms of the revelation principle
The revelation principle is a cornerstone tool in mechanism design. It states that one can restrict attention, without loss in the designer’s objective, to mechanisms in which A...
Vincent Conitzer, Tuomas Sandholm