Sciweavers

945 search results - page 61 / 189
» Incremental Branching Programs
Sort
View
CP
2006
Springer
14 years 21 days ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 7 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs
AFP
2008
Springer
245views Formal Methods» more  AFP 2008»
14 years 3 months ago
Self-adjusting Computation with Delta ML
Abstract. In self-adjusting computation, programs respond automatically and efficiently to modifications to their data by tracking the dynamic data dependences of the computation ...
Umut A. Acar, Ruy Ley-Wild
KBSE
2005
IEEE
14 years 2 months ago
Automated path generation for software fault localization
Localizing the cause(s) of an observable error lies at the heart of program debugging. Fault localization often proceeds by comparing the failing program run with some “successf...
Tao Wang, Abhik Roychoudhury
IISWC
2006
IEEE
14 years 3 months ago
Load Instruction Characterization and Acceleration of the BioPerf Programs
The load instructions of some of the bioinformatics applications in the BioPerf suite possess interesting characteristics: only a few static loads cover almost the entire dynamic ...
Paruj Ratanaworabhan, Martin Burtscher