Sciweavers

3267 search results - page 441 / 654
» Generalized quasirandom graphs
Sort
View
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
16 years 2 days ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
DIALM
2004
ACM
100views Algorithms» more  DIALM 2004»
16 years 22 hour ago
Virtual coordinates for ad hoc and sensor networks
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
Thomas Moscibroda, Regina O'Dell, Mirjam Wattenhof...
DMSN
2004
ACM
16 years 22 hour ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
IHM
2004
ACM
16 years 21 hour ago
Conception participative par "moments"
This paper describes an approach for the participatory design. After describing the trends in the domain, a formalization of the design process is expressed based on « phase »...
Jean Caelen, Francis Jambon
ISPD
2004
ACM
92views Hardware» more  ISPD 2004»
16 years 21 hour ago
A predictive distributed congestion metric and its application to technology mapping
Due to increasing design complexity, routing congestion has become a critical problem in VLSI designs. This paper introduces a distributed metric to predict routing congestion for...
Rupesh S. Shelar, Sachin S. Sapatnekar, Prashant S...