206 search results - page 20 / 42 » A branch-and-bound algorithm for hard multiple knapsack prob... |
76
Voted
GLOBECOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
IMC
2003
ACM
15 years 2 months ago
2003
ACM
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
JAIR
2008
14 years 9 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
127
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
109
click to vote
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...