874 search results - page 34 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
113
click to vote
IPPS
1997
IEEE
15 years 5 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
110
click to vote
SASO
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distrib...
121
click to vote
VLDB
1999
ACM
15 years 5 months ago
1999
ACM
On-Line Analytical Processing (OLAP) based on a dimensional view of data is being used increasingly for the purpose of analyzing very large amounts of data. To improve query perfo...
128
click to vote
KES
1999
Springer
15 years 5 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
DIS
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...