Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
We describe the objectives and organization of the CLEF 2006 ad hoc track and discuss the main characteristics of the tasks offered to test monolingual, bilingual, and multilingual...
Giorgio Maria Di Nunzio, Nicola Ferro, Thomas Mand...
In this paper we introduce a framework to supplement and tag computerized CPG with related best-evidence automatically sourced from on-line medical literature repositories. The id...
Syed Sibte Raza Abidi, Michael Kershaw, Evangelos ...
The UNED phrase-based cross-language summaries were first introduced at iCLEF 2001 as a translation strategy which permitted faster document selection with roughly the same accur...
We propose to integrate ACO in a Constraint Programming (CP) language. Basically, we use the CP language to describe the problem to solve by means of constraints and we use the CP ...