13151 search results - page 2339 / 2631 » Position based dynamics |
203
click to vote
PEPM
1993
ACM
15 years 10 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
167
Voted
RSCTC
1993
Springer
15 years 10 months ago
1993
Springer
: While the common kinds of uncertainties in databases (e.g., null values, disjunction, corrupt/missing data, domain mismatch, etc.) have been extensively studied, a relatively une...
194
click to vote
SPAA
1994
ACM
15 years 10 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
201
click to vote
SIGOPSE
1992
ACM
15 years 10 months ago
1992
ACM
Abstract-- This paper describes the design and implementation1 of IRIS: an intentional resource indicator service. IRIS springs from the concept that end-users should not be bogged...
173
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...