Sciweavers

346 search results - page 55 / 70
» Solving quantified constraint satisfaction problems
Sort
View
VDB
1998
275views Database» more  VDB 1998»
14 years 11 months ago
Building Metaphors for Supporting User Interaction with Multimedia Databases
In this paper we discuss how metaphors for supporting user interaction with multimedia databases can be automatically generated. The work presented is a further step in the develo...
Maria Francesca Costabile, Donato Malerba, Matthia...
ANOR
2004
116views more  ANOR 2004»
14 years 9 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
CP
2000
Springer
15 years 1 months ago
Maintaining Arc-Consistency within Dynamic Backtracking
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...
Narendra Jussien, Romuald Debruyne, Patrice Boizum...
IJSN
2006
87views more  IJSN 2006»
14 years 9 months ago
Workflow authorisation in mediator-free environments
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
CSCLP
2004
Springer
15 years 3 months ago
A Value Ordering Heuristic for Local Search in Distributed Resource Allocation
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
Adrian Petcu, Boi Faltings