1743 search results - page 149 / 349 » Generalized Modal Satisfiability |
131
click to vote
MIR
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose an autonomous learning scheme to automatically build visual semantic concept models from the output data of Internet search engines without any manual la...
127
Voted
DAC
2001
ACM
16 years 4 months ago
2001
ACM
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
111
click to vote
DAC
2002
ACM
16 years 4 months ago
2002
ACM
We propose Satisfiability Checking (SAT) techniques that lead to a consistent performance improvement of up to 3x over state-ofthe-art SAT solvers like Chaff on important problem ...
127
Voted
WWW
2009
ACM
16 years 4 months ago
2009
ACM
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
134
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...