976 search results - page 51 / 196 » The Complexity of Timetable Construction Problems |
CIKM
2009
Springer
14 years 13 days ago
2009
Springer
Supporting semantic queries in relational databases is essential to many advanced applications. Recently, with the increasing use of ontology in various applications, the need for...
GPEM
2008
13 years 9 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
ESORICS
1998
Springer
14 years 1 months ago
1998
Springer
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
CHI
1995
ACM
14 years 20 days ago
1995
ACM
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...