2924 search results - page 150 / 585 » Lower Bounds in Distributed Computing |
142
click to vote
CONCUR
2001
Springer
15 years 7 months ago
2001
Springer
Bounded model checking has been recently introduced as an efficient verification method for reactive systems. In this work we apply bounded model checking to asynchronous systems....
122
click to vote
ICLP
2007
Springer
15 years 6 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
117
click to vote
PKDD
2010
Springer
15 years 27 days ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
114
click to vote
JOC
2006
15 years 3 months ago
2006
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
129
click to vote
WG
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...