281 search results - page 31 / 57 » Toward Practical Constraint Databases |
ESORICS
2007
Springer
14 years 2 months ago
2007
Springer
Current trust models enable decision support at an implicit level by means of thresholds or constraint satisfiability. Decision support is mostly included only for a single binary...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
ALPIT
2007
IEEE
14 years 2 months ago
2007
IEEE
While information retrieval (IR) and databases (DB) have been developed independently, there have been emerging requirements that both data management and efficient text retrieva...
DAGSTUHL
1998
13 years 9 months ago
1998
Deductive database technology represents an important step towards the goal of developing highly-declarative database programming languages. In order to make deductive databases a ...