Sciweavers

659 search results - page 89 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
98
Voted
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
15 years 10 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
85
Voted
ICDCS
2006
IEEE
15 years 4 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu
85
Voted
SAT
2004
Springer
85views Hardware» more  SAT 2004»
15 years 3 months ago
Visualizing the Internal Structure of SAT Instances (Preliminary Report)
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Carsten Sinz
76
Voted
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
15 years 1 days ago
Synchronization in networks of identical linear systems
The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main resul...
Luca Scardovi, Rodolphe Sepulchre
AAAI
1994
14 years 11 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter