1940 search results - page 93 / 388 » Search with Synonyms: Problems and Solutions |
190
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
202
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
214
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
155
click to vote
AIPS
2008
15 years 8 months ago
2008
We present a planner for the Combat Power Management (CPM) problem. In response to multiple simultaneous or sequential threats, the planner generates a set of local plans, one for...
200
click to vote
LION
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...