607 search results - page 53 / 122 » Unifying Exact Completions |
ALGORITHMICA
2004
14 years 11 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
ESOP
2012
Springer
13 years 6 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...
106
click to vote
AAMAS
2012
Springer
13 years 6 months ago
2012
Springer
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
ICIP
2008
IEEE
16 years 23 days ago
2008
IEEE
This article presents a new algorithm for spatial deinterlacing that could easily be integrated in a more complete deinterlacing system. The spatial interpolation process often fa...
154
click to vote
ICDE
2004
IEEE
16 years 12 days ago
2004
IEEE
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...