Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
Antonio Garrido Tejero, Eva Onaindia, Federico Bar...
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicat...
A general problem in model selection is to obtain the right parameters that make a model "t observed data. For a multilayer perceptron (MLP) trained with back-propagation (BP...
Pedro A. Castillo Valdivieso, Juan J. Merelo Guerv...
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...