Volgen
Andrea Schaerf
Andrea Schaerf
Professor of Computer Science, DPIA, University of Udine, Italy
Geverifieerd e-mailadres voor uniud.it - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
A survey of automated timetabling
A Schaerf
Artificial Intelligence Review 13 (2), 87-127, 1999
13231999
Reasoning in description logics
FM Donini, M Lenzerini, D Nardi, A Schaerf
Center for the Study of Language and Information, Stanford, CA. Principlesá…, 1997
5761997
AL-log: Integrating Datalog and Description Logics
FM Donini, M Lenzerini, D Nardi, A Schaerf
Journal of Intelligent Information Systems 10, 227-252, 1998
4111998
Decidable reasoning in terminological knowledge representation systems
M Buchheit, FM Donini, A Schaerf
Journal of artificial intelligence research 1, 109-138, 1993
3941993
Tabu search techniques for examination timetabling
L Di Gaspero, A Schaerf
Practice and Theory of Automated Timetabling III: Third Internationalá…, 2001
3592001
Setting the research agenda in automated timetabling: The second international timetabling competition
B McCollum, A Schaerf, B Paechter, P McMullan, R Lewis, AJ Parkes, ...
INFORMS Journal on Computing 22 (1), 120-130, 2010
3042010
Adaptive load balancing: A study in multi-agent learning
A Schaerf, Y Shoham, M Tennenholtz
Journal of artificial intelligence research 2, 475-500, 1994
2861994
The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3)
L Di Gaspero, B McCollum, A Schaerf
Technical Report QUB/IEEE/Tech/ITC2007/CurriculumCTT/v1. 0, Queen’sá…, 2007
2082007
An epistemic operator for description logics
FM Donini, M Lenzerini, D Nardi, W Nutt, A Schaerf
Artificial Intelligence 100 (1-2), 225-274, 1998
2041998
EASYLOCAL++: an object‐oriented framework for the flexible design of local‐search algorithms
L Di Gaspero, A Schaerf
Software: Practice and Experience 33 (8), 733-765, 2003
1922003
Local search techniques for constrained portfolio selection problems
A Schaerf
Computational Economics 20, 177-190, 2002
1912002
Deduction in concept languages: From subsumption to instance checking
FM Donini, M Lenzerini, D Nardi, A Schaerf
Journal of logic and computation 4 (4), 423-452, 1994
1871994
Reasoning with individuals in concept languages
A Schaerf
Data & Knowledge Engineering 13 (2), 141-176, 1994
1811994
Tabu search techniques for large high-school timetabling problems
A Schaerf
Proceedings of the thirteenth national conference on Artificial intelligenceá…, 1996
1801996
Local search techniques for large high school timetabling problems
A Schaerf
IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems andá…, 1999
1691999
The first international nurse rostering competition 2010
S Haspeslagh, P De Causmaecker, A Schaerf, M St°levik
Annals of Operations Research 218 (1), 221-236, 2014
1462014
The first international nurse rostering competition 2010
S Haspeslagh, P De Causmaecker, A Schaerf, M St°levik
Annals of Operations Research 218 (1), 221-236, 2014
1462014
Adding Epistemic Operators to Concept Languages.
FM Donini, M Lenzerini, D Nardi, A Schaerf, W Nutt
KR 92, 342-353, 1992
1451992
A composite-neighborhood tabu search approach to the traveling tournament problem
LD Gaspero, A Schaerf
Journal of Heuristics 13, 189-207, 2007
1332007
On the complexity of the instance checking problem in concept languages with existential quantification
A Schaerf
Journal of Intelligent Information Systems 2 (3), 265-278, 1993
1311993
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20