Sciweavers

1927 search results - page 48 / 386
» UMDAs for dynamic optimization problems
Sort
View
104
Voted
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
15 years 6 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
15 years 7 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
CIDU
2010
14 years 10 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
93
Voted
TVCG
2010
161views more  TVCG 2010»
14 years 11 months ago
Globally Optimized Linear Windowed Tone Mapping
—This paper introduces a new tone mapping operator that performs local linear adjustments on small overlapping windows over the entire input image. While each window applies a lo...
Qi Shan, Jiaya Jia, Michael S. Brown
AAAI
2008
15 years 2 months ago
An Efficient Motion Planning Algorithm for Stochastic Dynamic Systems with Constraints on Probability of Failure
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
Masahiro Ono, Brian C. Williams