575 search results - page 25 / 115 » A Spectral Approach to Lower Bounds |
95
Voted
AUSAI
2004
Springer
15 years 6 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
89
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
146
click to vote
LCTRTS
2010
Springer
15 years 2 months ago
2010
Springer
In preemptive real-time systems, scheduling analyses need—in addition to the worst-case execution time—the context-switch cost. In case of preemption, the preempted and the pr...
116
Voted
KDD
2005
ACM
16 years 1 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
103
Voted
ENTCS
2007
15 years 21 days ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...