2372 search results - page 218 / 475 » Probabilistic calling context |
136
Voted
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
112
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
164
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The advancement of network induces great demands on a series of applications such as the multicast routing. This paper firstly makes a brief review on the algorithms in ...
122
click to vote
PAKDD
2009
ACM
15 years 10 months ago
2009
ACM
Abstract. An object o of a database D is called a hot item, if there is a sufficiently large population of other objects in D that are similar to o. In other words, hot items are ...
126
Voted
DATE
2009
IEEE
15 years 10 months ago
2009
IEEE
—More and more processor manufacturers have launched embedded multicore processors for consumer electronics products because such processors provide high performance and low powe...