Sciweavers

5331 search results - page 751 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
IMECS
2007
15 years 8 months ago
A Common Subexpression Sharing Approach for Multiplierless Synthesis of Multiple Constant Multiplications
—In the context of multiple constant multiplications (MCM) design, we propose a novel common-subexpression-elimination (CSE) algorithm that models synthesis of coefficients into ...
Yuen-Hong Alvin Ho, Chi-Un Lei, Ngai Wong
AIPS
2009
15 years 7 months ago
Incremental Policy Generation for Finite-Horizon DEC-POMDPs
Solving multiagent planning problems modeled as DECPOMDPs is an important challenge. These models are often solved by using dynamic programming, but the high resource usage of cur...
Christopher Amato, Jilles Steeve Dibangoye, Shlomo...
DAIS
2009
15 years 7 months ago
Foraging for Better Deployment of Replicated Service Components
Abstract. Our work focuses on distributed software services and their requirements in terms of system performance and dependability. We target the problem of finding optimal deploy...
Máté J. Csorba, Hein Meling, Poul E....
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
15 years 7 months ago
Precision, local search and unimodal functions
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wege...
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 6 months ago
On the Convexity of Latent Social Network Inference
In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, w...
Seth A. Myers, Jure Leskovec