4432 search results - page 418 / 887 » Solving Demodulation as an Optimization Problem |
127
Voted
IJCAI
2007
15 years 6 months ago
2007
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of...
120
click to vote
AAAI
2006
15 years 6 months ago
2006
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
143
Voted
SIGOPS
2010
15 years 2 months ago
2010
Multi-tier architectures are widely used by internet applications. Guaranteeing the performance, and more generally the quality of service (QoS), of such applications remains a cr...
183
click to vote
ISMM
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Surface reconstruction from a set of noisy point measurements has been a well studied problem for several decades. Recently, variational and discrete optimization approac...
134
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Differential evolution (DE) is well known as a simple and efficient scheme for global optimization over continuous spaces. In this paper we present two new, improved variants of D...