1041 search results - page 167 / 209 » Randomizing Reductions of Search Problems |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
In evolutionary computation, experimental results are commonly analyzed using an algorithmic performance metric called best-so-far. While best-so-far can be a useful metric, its u...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
JAIR
2006
13 years 7 months ago
2006
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
WSC
2004
13 years 9 months ago
2004
This paper explores an approach to global, stochastic, simulation optimization which combines stochastic approximation (SA) with simulated annealing (SAN). SA directs a search of ...
TSMC
2010
13 years 2 months ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...