7991 search results - page 491 / 1599 » Using More Reasoning to Improve |
213
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
194
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Many decision and optimization problems in Electronic Design Automation (EDA) can be solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find app...
219
click to vote
DEXA
2008
Springer
15 years 8 months ago
2008
Springer
Query recommendation suggests related queries for search engine users when they are not satisfied with the results of an initial input query, thus assisting users in improving sear...
186
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
185
click to vote
NIPS
2007
15 years 8 months ago
2007
Under natural viewing conditions, human observers shift their gaze to allocate processing resources to subsets of the visual input. Many computational models try to predict such v...