Sciweavers

923 search results - page 116 / 185
» On the Topology of Discrete Strategies
Sort
View
SARA
2000
Springer
14 years 25 days ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith
INFOCOM
1995
IEEE
14 years 25 days ago
Virtual Path Bandwidth Allocation in Multi-User Networks
— We consider a multiuser network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own selfish performance measure. This measure account...
Aurel A. Lazar, Ariel Orda, Dimitrios E. Pendaraki...
SIROCCO
2010
13 years 10 months ago
Event Extent Estimation
This paper studies local-control strategies to estimate the size of a certain event affecting an arbitrary connected subset of nodes in a network. For example, our algorithms allow...
Marcin Bienkowski, Leszek Gasieniec, Marek Klonows...
ICWN
2007
13 years 10 months ago
Utility-Based Divisible Sensing Task Scheduling in Wireless Sensor Networks
This paper presents a tractable optimization strategies of sensing workload scheduling in wireless sensor networks using Divisible Load Theory (DLT). Because of the limited batter...
Xiaolin Li, Xinxin Liu, Peng Guan, Hui Kang
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 10 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya