16082 search results - page 536 / 3217 » Fireworks Algorithm for Optimization |
192
click to vote
ESA
1997
Springer
15 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
168
click to vote
JAIR
2008
15 years 7 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
192
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
163
click to vote
NIPS
2004
15 years 8 months ago
2004
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
189
click to vote
MM
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we address the problem of choosing a disk admission algorithm for continuous media streams where each stream may have a di erent bit rate, and more importantly, whe...