Sciweavers

5595 search results - page 753 / 1119
» Comparing Subsumption Optimizations
Sort
View
ICDCSW
2005
IEEE
16 years 1 months ago
QoS Oriented Dynamic Replica Cost Model for P2P Computing
Replication on multiple nodes is an effective way to improve the availability in the P2P or grid environment. It is difficult to determine how many replicas can fulfill the user r...
Feng Mao, Hai Jin, Deqing Zou, Baoli Chen, Li Qi
SIGMETRICS
2005
ACM
120views Hardware» more  SIGMETRICS 2005»
16 years 1 months ago
Automatic measurement of memory hierarchy parameters
The running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowled...
Kamen Yotov, Keshav Pingali, Paul Stodghill
216
Voted
WABI
2005
Springer
120views Bioinformatics» more  WABI 2005»
16 years 28 days ago
Multiple Structural RNA Alignment with Lagrangian Relaxation
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
Markus Bauer, Gunnar W. Klau, Knut Reinert
SAC
2004
ACM
16 years 27 days ago
A cost-oriented approach for infrastructural design
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
16 years 26 days ago
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
Gunnar W. Klau, Ivana Ljubic, Andreas Moser, Petra...