Sciweavers

661 search results - page 2 / 133
» Combining Information using Hard Constraints
Sort
View
IPPS
2000
IEEE
13 years 9 months ago
Are COTS Suitable for Building Distributed Fault-Tolerant Hard Real-Time Systems?
For economic reasons, a new trend in the development of distributed hard real-time systems is to rely on the use of CommercialO -The-Shelf cots hardware and operating systems. As...
Pascal Chevochot, Antoine Colin, David Decotigny, ...
IJCAI
2007
13 years 6 months ago
Combining Topological and Directional Information for Spatial Reasoning
Current research on qualitative spatial representation and reasoning usually focuses on one single aspect of space. However, in real world applications, several aspects are often ...
Sanjiang Li
KDD
2005
ACM
218views Data Mining» more  KDD 2005»
14 years 5 months ago
A maximum entropy web recommendation system: combining collaborative and content features
Web users display their preferences implicitly by navigating through a sequence of pages or by providing numeric ratings to some items. Web usage mining techniques are used to ext...
Xin Jin, Yanzan Zhou, Bamshad Mobasher
CP
2003
Springer
13 years 10 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
IJCAI
1993
13 years 6 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe