Sciweavers

810 search results - page 156 / 162
» Solving Time-Dependent Planning Problems
Sort
View
RTAS
1999
IEEE
14 years 3 days ago
On Quality of Service Optimization with Discrete QoS Options
We present a QoS management framework that enables us to quantitatively measure QoS, and to analytically plan and allocate resources. In this model, end users' quality prefer...
Chen Lee, John P. Lehoczky, Ragunathan Rajkumar, D...
ANLP
1997
110views more  ANLP 1997»
13 years 9 months ago
Automating NL Appointment Scheduling with COSMA
Appointment scheduling is a problem faced daily by many individuals and organizations. Cooperating agent systems have been developed to partially automate this task. In order to e...
Stephan Busemann
AIPS
2009
13 years 9 months ago
Efficient Solutions to Factored MDPs with Imprecise Transition Probabilities
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
Karina Valdivia Delgado, Scott Sanner, Leliane Nun...
GECCO
2010
Springer
244views Optimization» more  GECCO 2010»
13 years 8 months ago
Implicit fitness and heterogeneous preferences in the genetic algorithm
This paper takes an economic approach to derive an evolutionary learning model based entirely on the endogenous employment of genetic operators in the service of self-interested a...
Justin T. H. Smith
BMCBI
2010
139views more  BMCBI 2010»
13 years 8 months ago
A global optimization algorithm for protein surface alignment
Background: A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined w...
Paola Bertolazzi, Concettina Guerra, Giampaolo Liu...