Sciweavers

2698 search results - page 165 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
PVLDB
2010
140views more  PVLDB 2010»
15 years 4 months ago
Optimal Top-K Query Evaluation for Weighted Business Processes
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
Daniel Deutch, Tova Milo, Neoklis Polyzotis, Tom Y...
INFOCOM
2007
IEEE
16 years 23 days ago
Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Abstract— Data aggregation is a fundamental yet timeconsuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation...
Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Ying...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
15 years 6 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
FCS
2008
15 years 8 months ago
Autonomous Scheduling
Abstract. Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their t...
Chetan Yadati, Cees Witteveen, Yingqian Zhang, Men...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
15 years 7 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller