Sciweavers

19700 search results - page 3837 / 3940
» DNA-Based Computation Times
Sort
View
EUROPAR
2005
Springer
14 years 2 months ago
Hierarchical Scheduling for Moldable Tasks
The model of moldable task (MT) was introduced some years ago and has been proved to be an efficient way for implementing parallel applications. It considers a target application ...
Pierre-François Dutot
GD
2005
Springer
14 years 2 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
14 years 2 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
HPCC
2005
Springer
14 years 2 months ago
A Hybrid Web Server Architecture for Secure e-Business Web Applications
Nowadays the success of many e-commerce applications, such as on-line banking, depends on their reliability, robustness and security. Designing a web server architecture that keep...
Vicenç Beltran, David Carrera, Jordi Guitar...
ICALP
2005
Springer
14 years 2 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
« Prev « First page 3837 / 3940 Last » Next »