Sciweavers

2944 search results - page 459 / 589
» On Well Quasi-orders on Languages
Sort
View
CP
2003
Springer
15 years 11 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
CP
2003
Springer
15 years 11 months ago
Terminating Decision Algorithms Optimally
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
Tuomas Sandholm
CP
2003
Springer
15 years 11 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
ER
2003
Springer
129views Database» more  ER 2003»
15 years 11 months ago
Querying Heterogeneous XML Sources through a Conceptual Schema
XML is a widespread W3C standard used by several kinds of applications for data representation and exchange over the web. In the context of a system that provides semantic integrat...
Sandro Daniel Camillo, Carlos A. Heuser, Ronaldo d...
ESORICS
2003
Springer
15 years 11 months ago
A Toolkit for Managing Enterprise Privacy Policies
Abstract. Enterprise privacy enforcement allows enterprises to internally enforce a privacy policy that the enterprise has decided to comply to. An enterprise privacy policy often ...
Michael Backes, Birgit Pfitzmann, Matthias Schunte...