Sciweavers

2244 search results - page 69 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
CSCLP
2004
Springer
15 years 10 months ago
Constraint-Based Approaches to the Covering Test Problem
Covering arrays have been studied for their applications to drug screening and software and hardware testing. In this paper, we model the problem as a constraint program. Our propo...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
ACCV
2007
Springer
15 years 8 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
15 years 7 months ago
A parallel evolutionary algorithm for unconstrained binary quadratic problems
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
István Borgulya
GECCO
2003
Springer
134views Optimization» more  GECCO 2003»
15 years 11 months ago
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
Andrew Lim, Zhou Xu
CORR
2008
Springer
127views Education» more  CORR 2008»
15 years 6 months ago
MAPEL: Achieving Global Optimality for a Non-convex Wireless Power Control Problem
Achieving weighted throughput maximization (WTM) through power control has been a long standing open problem in interference-limited wireless networks. The complicated coupling bet...
Liping Qian, Ying Jun Zhang, Jianwei Huang