Sciweavers

975 search results - page 62 / 195
» Locality Optimization for Program Instances
Sort
View
PASTE
2010
ACM
15 years 2 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
DISOPT
2008
85views more  DISOPT 2008»
14 years 9 months ago
How tight is the corner relaxation?
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
Matteo Fischetti, Michele Monaci
SIAMAM
2010
84views more  SIAMAM 2010»
14 years 8 months ago
Multidisciplinary Free Material Optimization
We present a mathematical framework for the so-called multidisciplinary free material optimization (MDFMO) problems, a branch of structural optimization in which the full material ...
Jaroslav Haslinger, Michal Kocvara, Günter Le...
ANTSW
2004
Springer
15 years 3 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
PDPTA
2004
14 years 11 months ago
Telepresent Agents: A New Paradigm for Networked Systems
Telepresent Agents are software Agents that are instantiated simultaneously within two or more distinct computer applications (called Locales) which are operating at distinct nodes...
Russ Abbott, Behzad Parviz, Chengyu Sun