Sciweavers

1485 search results - page 121 / 297
» Whole Program Paths
Sort
View
EOR
2007
117views more  EOR 2007»
13 years 9 months ago
Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
EOR
2002
89views more  EOR 2002»
13 years 9 months ago
Analytic centers and repelling inequalities
ct 9 The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling 10 path is a generalization of the analytic central path fo...
Richard J. Caron, Harvey J. Greenberg, Allen G. Ho...
SIGSOFT
2005
ACM
14 years 10 months ago
Automatic generation of suggestions for program investigation
Before performing a modification task, a developer usually has to investigate the source code of a system to understand how to carry out the task. Discovering the code relevant to...
Martin P. Robillard
POPL
2010
ACM
14 years 6 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
14 years 16 days ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley