Sciweavers

2084 search results - page 310 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
AAAI
2007
15 years 5 days ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
PODC
2006
ACM
15 years 3 months ago
Adversarial queuing on the multiple-access channel
We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is co...
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A....
HICSS
2007
IEEE
138views Biometrics» more  HICSS 2007»
15 years 4 months ago
A Probabilistic Graphical Approach to Computing Electricity Price Duration Curves under Price and Quantity Competition
Abstract— The electricity price duration curve (EPDC) represents the probability distribution function of the electricity price considered as a random variable. The price uncerta...
Pascal Michaillat, Shmuel S. Oren
POPL
2002
ACM
15 years 10 months ago
Adaptive functional programming
An adaptive computation maintains the relationship between its input and output as the input changes. Although various techniques for adaptive computing have been proposed, they r...
Umut A. Acar, Guy E. Blelloch, Robert Harper