Sciweavers

1263 search results - page 137 / 253
» A* with Bounded Costs
Sort
View
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
14 years 4 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 3 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 2 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek