152 search results - page 10 / 31 » Efficiently Exploiting Dependencies in Local Search for SAT |
MICRO
2008
IEEE
13 years 10 months ago
2008
IEEE
Dynamically tracking the flow of data within a microprocessor creates many new opportunities to detect and track malicious or erroneous behavior, but these schemes all rely on the...
CP
2006
Springer
14 years 1 months ago
2006
Springer
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
SEMWEB
2010
Springer
13 years 8 months ago
2010
Springer
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approac...
SIGMOD
2004
ACM
14 years 10 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
CPAIOR
2006
Springer
14 years 19 hour ago
2006
Springer
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...