2988 search results - page 182 / 598 » Experiments with a New Boosting Algorithm |
178
click to vote
SIGMOD
1993
ACM
15 years 8 months ago
1993
ACM
This paper introduces a new approach to database disk buffering, called the LRU–K method. The basic idea of LRU–K is to keep track of the times of the last K references to pop...
182
click to vote
ANTSW
2004
Springer
15 years 8 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
160
Voted
ICCAD
2007
IEEE
16 years 1 months ago
2007
IEEE
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
130
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
229
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...