Sciweavers

185 search results - page 35 / 37
» Parameterized Complexity of Constraint Satisfaction Problems
Sort
View
VLDB
2002
ACM
151views Database» more  VLDB 2002»
13 years 7 months ago
Preference SQL - Design, Implementation, Experiences
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
Werner Kießling, Gerhard Köstler
SPATIALCOGNITION
2004
Springer
14 years 29 days ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
KR
1992
Springer
13 years 11 months ago
Intelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows i.e. earliest latest possible start...
Yalin Xiong, Norman M. Sadeh, Katia P. Sycara
AAAI
2000
13 years 9 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
NIPS
2003
13 years 9 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand