Sciweavers

10907 search results - page 287 / 2182
» Constraint Based Strategies
Sort
View
ICPPW
2003
IEEE
15 years 11 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang
DOLAP
1999
ACM
15 years 10 months ago
A Dynamic Load Balancing Strategy for Parallel Datacube Computation
In recent years, OLAP technologies have become one of the important applications in the database industry. In particular, the datacube operation proposed in [5] receives strong at...
Seigo Muto, Masaru Kitsuregawa
ICDCS
1996
IEEE
15 years 10 months ago
Dynamic Scheduling Strategies for Shared-memory Multiprocessors
Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, ...
Babak Hamidzadeh, David J. Lilja
GECCO
2006
Springer
119views Optimization» more  GECCO 2006»
15 years 9 months ago
Mixed-integer optimization of coronary vessel image analysis using evolution strategies
In this paper we compare Mixed-Integer Evolution Strategies (MI-ES) and standard Evolution Strategies (ES) when applied to find optimal solutions for artificial test problems and ...
Rui Li, Michael Emmerich, Jeroen Eggermont, Ernst ...
ATAL
2010
Springer
15 years 7 months ago
A game-theoretic analysis of market selection strategies for competing double auction marketplaces
In this paper, we propose a novel general framework for analysing competing double auction markets that vie for traders, who then need to choose which market to go to. Based on th...
Bing Shi, Enrico H. Gerding, Perukrishnen Vyteling...