Sciweavers

1277 search results - page 138 / 256
» Terminating Decision Algorithms Optimally
Sort
View
112
Voted
EVOW
2009
Springer
15 years 10 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
EMO
2009
Springer
159views Optimization» more  EMO 2009»
15 years 10 months ago
Recombination for Learning Strategy Parameters in the MO-CMA-ES
The multi-objective covariance matrix adaptation evolution strategy (MO-CMA-ES) is a variable-metric algorithm for real-valued vector optimization. It maintains a parent population...
Thomas Voß, Nikolaus Hansen, Christian Igel
106
Voted
WSC
2004
15 years 4 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
126
Voted
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 3 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
ICML
2006
IEEE
16 years 4 months ago
Qualitative reinforcement learning
When the transition probabilities and rewards of a Markov Decision Process are specified exactly, the problem can be solved without any interaction with the environment. When no s...
Arkady Epshteyn, Gerald DeJong