Sciweavers

2657 search results - page 445 / 532
» On the complexity of hierarchical problem solving
Sort
View
GD
2005
Springer
15 years 3 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
15 years 3 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
ICSOC
2005
Springer
15 years 3 months ago
Service Oriented Architectures for Science Gateways on Grid Systems
Grid computing is about allocating distributed collections of resources including computers, storage systems, networks and instruments to form a coherent system devoted to a “vir...
Dennis Gannon, Beth Plale, Marcus Christie, Liang ...
EUROPAR
2004
Springer
15 years 3 months ago
Designing Parallel Operating Systems via Parallel Programming
Abstract. Ever-increasing demand for computing capability is driving the construction of ever-larger computer clusters, soon to be reaching tens of thousands of processors. Many fu...
Eitan Frachtenberg, Kei Davis, Fabrizio Petrini, J...
ICFEM
2004
Springer
15 years 3 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom