7522 search results - page 319 / 1505 » Spacing memetic algorithms |
173
click to vote
ICCD
2005
IEEE
16 years 3 months ago
2005
IEEE
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
174
click to vote
STACS
2007
Springer
16 years 26 days ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
213
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...
163
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper we study the technology mapping problem for FPGA architectures to minimize chip area, or the total number of lookup tables (LUTs) of the mapped design, under the chi...
214
click to vote
GECCO
2007
Springer
16 years 28 days ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...