5595 search results - page 736 / 1119 » Comparing Subsumption Optimizations |
210
click to vote
ASPLOS
2000
ACM
15 years 12 months ago
2000
ACM
Recently, there has been a growing interest in exploiting profile information in adaptive systems such as just-in-time compilers, dynamic optimizers and, binary translators. In th...
198
click to vote
SIGCOMM
1999
ACM
15 years 12 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
256
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Multi-Agent Agreement problems (MAP) - the ability of a population of agents to search out and converge on a common state - are central issues in many multi-agent settings, from d...
202
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a new optimization metaheuristic called ID Walk (Intensification/Diversification Walk) that offers advantages for combining simplicity with effectiveness. In ad...
241
click to vote
ECCV
2008
Springer
15 years 9 months ago
2008
Springer
We present a novel method for unsupervised classification, including the discovery of a new category and precise object and part localization. Given a set of unlabelled images, som...