When a user is served with a ranked list of relevant documents by the standard document search engines, his search task is usually not over. He has to go through the entire docume...
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
Raquel Fuentetaja, Daniel Borrajo, Carlos Linares ...
Current studies have demonstrated that the representational power of predictive state representations (PSRs) is at least equal to the one of partially observable Markov decision p...
Abdeslam Boularias, Masoumeh T. Izadi, Brahim Chai...