Sciweavers

1051 search results - page 148 / 211
» Foundations of Constraint Satisfaction
Sort
View
ECAI
2000
Springer
14 years 2 months ago
Incremental Forward Checking for the Disjunctive Temporal Problem
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
Angelo Oddi, Amedeo Cesta
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
14 years 2 months ago
A Combinatorial Approach to Content-Based Music Selection
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...
François Pachet, Pierre Roy, Daniel Cazaly
CSMR
1998
IEEE
14 years 2 months ago
Assessing Architectural Complexity
While it is widely agreed that architectural simplicity is a key factor to the success of large software systems, it is not obvious how to measure architectural complexity. Our ap...
Rick Kazman, M. Burth
ECAI
2004
Springer
14 years 1 months ago
Evaluation Strategies for Planning as Satisfiability
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...
Jussi Rintanen
CP
2006
Springer
14 years 1 months ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter