Sciweavers

238 search results - page 39 / 48
» Planning as Satisfiability
Sort
View
PATAT
2000
Springer
89views Education» more  PATAT 2000»
14 years 1 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
GIS
1995
ACM
14 years 1 months ago
Collaborative Spatial Decision Making with Qualitative Constraints
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
Nikos I. Karacapilidis, Dimitris Papadias, Max J. ...
ATMOS
2008
112views Optimization» more  ATMOS 2008»
13 years 11 months ago
Dynamic Algorithms for Recoverable Robustness Problems
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
Serafino Cicerone, Gabriele Di Stefano, Michael Sc...
IADIS
2004
13 years 11 months ago
Preliminary Steps in Designing and Implementing a Privilege Verifier for PMI
We have designed and deployed a system that uses X.509 public-key certificates (PKC) and attribute certificates (AC) for access control. This includes an authorization service for...
Diana Berbecaru, Antonio Lioy
FLAIRS
2006
13 years 11 months ago
CATS: A Synchronous Approach to Collaborative Group Recommendation
Group recommender systems introduce a whole set of new challenges for recommender systems research. The notion of generating a set of recommendations that will satisfy a group of ...
Kevin McCarthy, Maria Salamó, Lorcan Coyle,...