16082 search results - page 34 / 3217 » Fireworks Algorithm for Optimization |
120
click to vote
IPL
2008
15 years 1 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
138
click to vote
ICTAI
1997
IEEE
15 years 5 months ago
1997
IEEE
This paper proposes an optimization algorithm for reducing the power dissipation in a sequential circuit. The encoding of the different states in a Finite State Machine is modifie...
124
click to vote
ICCAD
1995
IEEE
15 years 5 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
138
click to vote
IJCAI
2001
15 years 3 months ago
2001
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
109
click to vote
ICPADS
1996
IEEE
15 years 6 months ago
1996
IEEE
In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of vic...