Sciweavers

1760 search results - page 70 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
MOR
2000
162views more  MOR 2000»
13 years 8 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
TWC
2008
99views more  TWC 2008»
13 years 9 months ago
Cross layer dynamic resource allocation with targeted throughput for WCDMA data
We consider resource allocation for elastic wireless applications that measure utility by target connection average throughput and achieved throughput. We construct a framework for...
Peifang Zhang, Scott Jordan
MOBICOM
2009
ACM
14 years 3 months ago
Lifetime and coverage guarantees through distributed coordinate-free sensor activation
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distribute...
Gaurav S. Kasbekar, Yigal Bejerano, Saswati Sarkar
DIS
2003
Springer
14 years 2 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
ICML
2000
IEEE
14 years 9 months ago
Learning Bayesian Networks for Diverse and Varying numbers of Evidence Sets
We introduce an expandable Bayesian network (EBN) to handle the combination of diverse multiple homogeneous evidence sets. An EBN is an augmented Bayesian network which instantiat...
Zu Whan Kim, Ramakant Nevatia