Sciweavers

70 search results - page 7 / 14
» An approximation algorithm for network design problems with ...
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 10 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
FSTTCS
2010
Springer
13 years 5 months ago
Minimizing Busy Time in Multiple Machine Real-time Scheduling
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
Rohit Khandekar, Baruch Schieber, Hadas Shachnai, ...
ICCV
2003
IEEE
14 years 9 months ago
Tracking Articulated Body by Dynamic Markov Network
A new method for visual tracking of articulated objects is presented. Analyzing articulated motion is challenging because the dimensionality increase potentially demands tremendou...
Ying Wu, Gang Hua, Ting Yu
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
13 years 11 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
EWSN
2004
Springer
14 years 1 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...