Sciweavers

73 search results - page 14 / 15
» A Landscape Analysis of Constraint Satisfaction Problems
Sort
View
EOR
2010
119views more  EOR 2010»
14 years 9 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
APLAS
2000
ACM
15 years 2 months ago
Kima - An Automated Error Correction System for Concurrent Logic Programs
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
Yasuhiro Ajiro, Kazunori Ueda
WISEC
2009
ACM
15 years 4 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
FOCS
1998
IEEE
15 years 2 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
PODS
2007
ACM
159views Database» more  PODS 2007»
15 years 10 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...