Sciweavers

1176 search results - page 161 / 236
» Implicit Abstraction Heuristics
Sort
View
ENDM
2010
136views more  ENDM 2010»
15 years 6 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
ACTA
2006
70views more  ACTA 2006»
15 years 6 months ago
Throughput analysis in wireless networks with multiple users and multiple channels
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
Amrinder Arora, Fanchun Jin, Gokhan Sahin, Hosam M...
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 6 months ago
Combining decision procedures for the reals
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...
Jeremy Avigad, Harvey Friedman
CORR
2007
Springer
147views Education» more  CORR 2007»
15 years 6 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
MP
2006
123views more  MP 2006»
15 years 6 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...