7047 search results - page 1003 / 1410 » Focusing on Binding and Computation |
175
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
163
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
151
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
When describing the resource usage of a program, it is usual to talk in asymptotic terms, such as the well-known “big O” notation, whereby we focus on the behaviour of the prog...
173
click to vote
CANDC
2009
ACM
16 years 1 months ago
2009
ACM
Serendipity has a long tradition in the history of science as having played a key role in many significant discoveries. Computer scientists, valuing the role of serendipity in dis...
172
click to vote
MM
2009
ACM
16 years 1 months ago
2009
ACM
Automatic visual categorization is critically dependent on labeled examples for supervised learning. As an alternative to traditional expert labeling, social-tagged multimedia is ...