Sciweavers

2124 search results - page 180 / 425
» An Efficient Framework for Order Optimization
Sort
View
COR
2008
128views more  COR 2008»
15 years 6 months ago
Solving dynamic stochastic economic models by mathematical programming decomposition methods
Discrete-time optimal control problems arise naturally in many economic problems. Despite the rapid growth in computing power and new developments in the literature, many economic...
Mercedes Esteban-Bravo, Francisco J. Nogales
CVPR
2005
IEEE
16 years 8 months ago
Infomax Boosting
In this paper, we described an efficient feature pursuit scheme for boosting. The proposed method is based on the infomax principle, which seeks optimal feature that achieves maxi...
Siwei Lyu
ATAL
2010
Springer
15 years 7 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
ICIC
2007
Springer
16 years 20 days ago
On the Convergence Properties of Quantum-Inspired Multi-Objective Evolutionary Algorithms
Abstract. In this paper, a general framework of quantum-inspired multiobjective evolutionary algorithms is proposed based on the basic principles of quantum computing and general s...
Zhiyong Li, Zhe Li, Günter Rudolph
CORR
2010
Springer
156views Education» more  CORR 2010»
15 years 6 months ago
The Exact Closest String Problem as a Constraint Satisfaction Problem
We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration o...
Tom Kelsey, Lars Kotthoff