627 search results - page 15 / 126 » Branched Polyhedral Systems |
168
click to vote
IPCO
2008
15 years 7 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
174
click to vote
CASES
2010
ACM
15 years 4 months ago
2010
ACM
Unobtrusive capturing of program execution traces in real-time is crucial in debugging cyber-physical systems. However, tracing even limited program segments is often cost-prohibi...
131
click to vote
PVM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This paper presents a grid-enabled system for solving largescale optimization problems. The system has been developed using Globus and MPICH-G2 grid technologies, and con...
147
click to vote
AAAI
2008
15 years 8 months ago
2008
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
175
click to vote
RTCSA
2009
IEEE
16 years 21 days ago
2009
IEEE
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...