Sciweavers

7930 search results - page 266 / 1586
» Greedy in Approximation Algorithms
Sort
View
AAAI
2008
15 years 9 months ago
Minimizing the Spread of Contamination by Blocking Links in a Network
We address the problem of minimizing the propagation of undesirable things, such as computer viruses or malicious rumors, by blocking a limited number of links in a network, a dua...
Masahiro Kimura, Kazumi Saito, Hiroshi Motoda
ATAL
2008
Springer
15 years 8 months ago
Reaction functions for task allocation to cooperative agents
In this paper, we present ARF, our initial effort at solving taskallocation problems where cooperative agents need to perform tasks simultaneously. An example is multi-agent routi...
Xiaoming Zheng, Sven Koenig
IPCO
2008
114views Optimization» more  IPCO 2008»
15 years 8 months ago
The Stochastic Machine Replenishment Problem
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
Kamesh Munagala, Peng Shi
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 6 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...
ICASSP
2010
IEEE
15 years 5 months ago
Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
Sunil K. Narang, Godwin Shen, Antonio Ortega