613 search results - page 22 / 123 » The Memory Fragmentation Problem: Solved |
133
click to vote
AUSAI
2003
Springer
15 years 7 months ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
107
click to vote
COR
2006
15 years 2 months ago
2006
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
124
click to vote
MICRO
2003
IEEE
15 years 7 months ago
2003
IEEE
In this paper we address the design of a future high-speed router that supports line rates as high as OC-3072 (160 Gb/s), around one hundred ports and several service classes. Bui...
114
click to vote
PC
2007
15 years 2 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
134
click to vote
FTTCS
2006
15 years 2 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...