Sciweavers

8094 search results - page 80 / 1619
» Improvements in Formula Generalization
Sort
View
WCET
2007
14 years 11 months ago
Analysis of path exclusion at the machine code level
We present a method to find static path exclusions in a control flow graph in order to refine the WCET analysis. Using this information, some infeasible paths can be discarded ...
Ingmar Stein, Florian Martin
CIE
2007
Springer
15 years 4 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
FLAIRS
2007
15 years 6 days ago
Handling Qualitative Preferences Using Normal Form Functions
Reasoning about preferences is a major issue in many decision making problems. Recently, a new logic for handling preferences, called Qualitative Choice Logic (QCL), was presented...
Salem Benferhat, Daniel Le Berre, Karima Sedki
WWW
2009
ACM
15 years 10 months ago
Improved techniques for result caching in web search engines
?? ?? ??? ?? ? ? ? ?? ??? ??? ? ?? ? ? ? ? ? ? ? ? ? ? ? ?? ? ? ? ? ? ? ??? ? ?? ?? ? ???? ? ? ?? ? ? ? ? ? ? ?? ? ?? ?? ??? ? ? ?? ?? ??? ?? ? ? ? ??? ? ? ??? ???? ???? ...
Qingqing Gan, Torsten Suel
SAT
2007
Springer
99views Hardware» more  SAT 2007»
15 years 4 months ago
Horn Upper Bounds and Renaming
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
Marina Langlois, Robert H. Sloan, György Tur&...