Sciweavers

261 search results - page 35 / 53
» On Threshold BDDs and the Optimal Variable Ordering Problem
Sort
View
AAAI
1997
13 years 9 months ago
Effective Redundant Constraints for Online Scheduling
The use of heuristics as a means to improve constraint solver performance has been researched widely. However, most work has been on problem-independentheuristics (e.g., variable ...
Lise Getoor, Greger Ottosson, Markus P. J. Fromher...
ICC
2007
IEEE
170views Communications» more  ICC 2007»
13 years 11 months ago
Adaptive Power Loading for OFDM-Based Cognitive Radio Systems
Abstract--Cognitive radio (CR) technology is an innovative radio design philosophy which aims to increase spectrum utilization by exploiting unused spectrum in dynamically changing...
Gaurav Bansal, Md. Jahangir Hossain, Vijay K. Bhar...
EOR
2008
70views more  EOR 2008»
13 years 7 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 9 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze