Sledovať
Andrea Schaerf
Andrea Schaerf
Professor of Computer Science, DPIA, University of Udine, Italy
Overená e-mailová adresa na: uniud.it - Domovská stránka
Názov
Citované v
Citované v
Rok
A survey of automated timetabling
A Schaerf
Artificial Intelligence Review 13 (2), 87-127, 1999
13451999
Reasoning in description logics
FM Donini, M Lenzerini, D Nardi, A Schaerf
Center for the Study of Language and Information, Stanford, CA. Principles …, 1997
5931997
AL-log: Integrating Datalog and Description Logics
FM Donini, M Lenzerini, D Nardi, A Schaerf
Journal of Intelligent Information Systems 10, 227-252, 1998
4151998
Decidable reasoning in terminological knowledge representation systems
M Buchheit, FM Donini, A Schaerf
Journal of artificial intelligence research 1, 109-138, 1993
4031993
Tabu search techniques for examination timetabling
L Di Gaspero, A Schaerf
Practice and Theory of Automated Timetabling III: Third International …, 2001
3632001
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
3122010
Adaptive load balancing: A study in multi-agent learning
A Schaerf, Y Shoham, M Tennenholtz
Journal of artificial intelligence research 2, 475-500, 1994
2901994
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
2172007
An epistemic operator for description logics
FM Donini, M Lenzerini, D Nardi, W Nutt, A Schaerf
Artificial Intelligence 100 (1-2), 225-274, 1998
2071998
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
1982003
Local search techniques for constrained portfolio selection problems
A Schaerf
Computational Economics 20, 177-190, 2002
1942002
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
1921994
Tabu search techniques for large high-school timetabling problems
A Schaerf
Proceedings of the thirteenth national conference on Artificial intelligence …, 1996
1821996
Reasoning with individuals in concept languages
A Schaerf
Data & Knowledge Engineering 13 (2), 141-176, 1994
1821994
Local search techniques for large high school timetabling problems
A Schaerf
IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and …, 1999
1681999
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
1552014
Adding Epistemic Operators to Concept Languages.
FM Donini, M Lenzerini, D Nardi, A Schaerf, W Nutt
KR 92, 342-353, 1992
1451992
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
1391993
A composite-neighborhood tabu search approach to the traveling tournament problem
LD Gaspero, A Schaerf
Journal of Heuristics 13, 189-207, 2007
1382007
Modelling and solving employee timetabling problems
A Meisels, A Schaerf
Annals of Mathematics and Artificial Intelligence 39, 41-59, 2003
1342003
Systém momentálne nemôže vykonať operáciu. Skúste to neskôr.
Články 1–20