Sciweavers

146 search results - page 11 / 30
» Optimally Solving the MCM Problem Using Pseudo-Boolean Satis...
Sort
View
SIAMCO
2011
14 years 10 months ago
Asymptotically Optimal Controls for Time-Inhomogeneous Networks
Abstract. A framework is introduced for the identification of controls for single-class timevarying queueing networks that are asymptotically optimal in the so-called uniform acce...
Milica Cudina, Kavita Ramanan
130
Voted
KES
2008
Springer
15 years 3 months ago
Knowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimiza...
Hitoshi Kanoh, Yuusuke Sakamoto
AIPS
2008
15 years 6 months ago
The Complexity of Optimal Planning and a More Efficient Method for Finding Solutions
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
Katrina Ray, Matthew L. Ginsberg
GECCO
2007
Springer
209views Optimization» more  GECCO 2007»
15 years 10 months ago
An online implementable differential evolution tuned optimal guidance law
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engag...
Raghunathan Thangavelu, S. Pradeep
JCNS
2010
103views more  JCNS 2010»
14 years 10 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski