1197 search results - page 116 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
ATAL
2006
Springer
14 years 1 days ago
2006
Springer
A major challenge in efficiently solving distributed resource allocation problems is to cope with the dynamic state changes that characterise such systems. An effective solution t...
GLOBECOM
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...