71228 search results - page 160 / 14246 » Algorithms |
173
click to vote
OOPSLA
2000
Springer
15 years 5 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
125
click to vote
ESA
2008
Springer
15 years 3 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...
117
click to vote
CIIT
2004
15 years 3 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
94
Voted
NIPS
2004
15 years 3 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...
106
Voted
UAI
2003
15 years 3 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...