11151 search results - page 160 / 2231 » On the Complexity of Model Expansion |
127
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
161
click to vote
DL
1994
Springer
15 years 8 months ago
1994
Springer
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
140
click to vote
STOC
1997
ACM
15 years 9 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
160
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
122
click to vote
WSC
2000
15 years 6 months ago
2000
Designing complex simulation models is a task essentially associated with software engineering. In this paper, the Unified Modeling Language (UML) is used to specify simulation mo...