4962 search results - page 666 / 993 » Stochastic Model Checking |
119
Voted
CP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
113
Voted
ILP
2000
Springer
15 years 6 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
105
Voted
WSC
2004
15 years 4 months ago
2004
This paper presents preliminary work done on simulationbased optimization of a stochastic material-dispatching system in a retailer network. The problem we consider is one of dete...
120
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
101
click to vote
EOR
2010
15 years 2 months ago
2010
-- The classical Wardrop System Optimum (SO) assignment model assumes that the users will cooperate with each other in order to minimize the overall travel costs. The importance of...