1382 search results - page 129 / 277 » Formal Analysis of Online Algorithms |
179
click to vote
ESA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
164
click to vote
ASAP
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
173
click to vote
ISTCS
1997
Springer
15 years 10 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
212
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Understanding research activity within any given biomedical field is important. Search outputs generated by MEDLINE/PubMed are not well classified and require lengthy ...
231
click to vote
TEC
2012
13 years 8 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...