Sciweavers

10901 search results - page 34 / 2181
» Approximations in Distributed Optimization
Sort
View
129
Voted
JGAA
2000
179views more  JGAA 2000»
15 years 2 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
129
Voted
TON
2008
133views more  TON 2008»
15 years 2 months ago
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
Cunqing Hua, Tak-Shing Peter Yum
JACM
2012
13 years 5 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
125
Voted
ATAL
2007
Springer
15 years 8 months ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara
ISCAS
2005
IEEE
133views Hardware» more  ISCAS 2005»
15 years 8 months ago
Multiobjective VLSI cell placement using distributed simulated evolution algorithm
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Sadiq M. Sait, Ali Mustafa Zaidi, Mustafa I. Ali