Sciweavers

697 search results - page 11 / 140
» Improving EAs for Sequencing Problems
Sort
View
CPAIOR
2009
Springer
14 years 2 months ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
SRDS
2000
IEEE
14 years 8 days ago
Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agreement Problems
Fault-tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the...
Stefan Pleisch, André Schiper
EVOW
2010
Springer
13 years 11 months ago
Improving Multi-Relief for Detecting Specificity Residues from Multiple Sequence Alignments
A challenging problem in bioinformatics is the detection of residues that account for protein function specificity, not only in order to gain deeper insight in the nature of functi...
Elena Marchiori
SAC
2003
ACM
14 years 1 months ago
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
Günther R. Raidl, Bryant A. Julstrom
LCTRTS
2010
Springer
13 years 5 months ago
Improving both the performance benefits and speed of optimization phase sequence searches
The issues of compiler optimization phase ordering and selection present important challenges to compiler developers in several domains, and in particular to the speed, code size,...
Prasad A. Kulkarni, Michael R. Jantz, David B. Wha...