8196 search results - page 259 / 1640 » Computational Modeling and Complexity Science |
137
click to vote
CAAP
1990
15 years 10 months ago
1990
act We show how to modelize concurrency between several processors in terms of automata and Markov chains; then, we define a concurrency measure which reflects more faithfully the ...
156
click to vote
ENTCS
2007
15 years 6 months ago
2007
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
170
click to vote
TSI
2008
15 years 6 months ago
2008
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
198
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
142
click to vote
IJCAI
1993
15 years 8 months ago
1993
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...