1502 search results - page 132 / 301 » Node weighted scheduling |
163
click to vote
SODA
1993
ACM
15 years 7 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
197
click to vote
INFORMATICALT
2011
15 years 1 months ago
2011
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
166
click to vote
ICNP
2009
IEEE
16 years 29 days ago
2009
IEEE
—With advances in energy harvesting techniques, it is now feasible to build sustainable sensor networks (SSN) to support long-term applications. Unlike battery-powered sensor net...
147
click to vote
ASPLOS
2006
ACM
16 years 8 days ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
166
click to vote
MAGS
2008
15 years 6 months ago
2008
This paper is about business modelling and negotiation protocol design in distributed scheduling, where individual agents have individual (potentially conflicting) interests. It i...