3 search results - page 1 / 1 » Revisiting the Upper Bounding Process in a Safe Branch and B... |
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
CORR
2009
Springer
13 years 2 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...