Sciweavers

591 search results - page 74 / 119
» A constraint programming approach to cutset problems
Sort
View
CP
2003
Springer
15 years 3 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
JNW
2007
112views more  JNW 2007»
14 years 9 months ago
A Multi-Commodity Flow Model for Optimal Routing in Wireless MESH Networks
— We propose a mathematical programming model of the routing problem in multi-hop wireless networks that takes into account quality of service requirements considering bandwidth ...
Antonio Capone, Fabio Martignon
ICASSP
2010
IEEE
14 years 10 months ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...
GECCO
2007
Springer
172views Optimization» more  GECCO 2007»
15 years 4 months ago
Real-coded ECGA for economic dispatch
In this paper, we propose a new approach that consists of the extended compact genetic algorithm (ECGA) and split-ondemand (SoD), an adaptive discretization technique, to economic...
Chao-Hong Chen, Ying-Ping Chen
ENTCS
2002
99views more  ENTCS 2002»
14 years 9 months ago
Greatest Bisimulations for Binary Methods
In previous work [14] I introduced a generalised notion of coalgebra that is capable of modelling binary methods as they occur in object-oriented programming. An important problem...
Hendrik Tews