Sciweavers

1639 search results - page 250 / 328
» Anytime Heuristic Search
Sort
View
ECAI
2004
Springer
14 years 2 months ago
IPSS: A Hybrid Reasoner for Planning and Scheduling
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...
María Dolores Rodríguez-Moreno, Ange...
CLEF
2009
Springer
13 years 10 months ago
UNIBA-SENSE @ CLEF 2009: Robust WSD Task
This paper presents the participation of the semantic N-levels search engine SENSE at the CLEF 2009 Ad Hoc Robust-WSD Task. During the participation at the same task of CLEF 2008,...
Pierpaolo Basile, Annalina Caputo, Giovanni Semera...
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 8 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
COR
2010
123views more  COR 2010»
13 years 8 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...
SIGIR
2008
ACM
13 years 8 months ago
A study of methods for negative relevance feedback
Negative relevance feedback is a special case of relevance feedback where we do not have any positive example; this often happens when the topic is difficult and the search result...
Xuanhui Wang, Hui Fang, ChengXiang Zhai