1686 search results - page 100 / 338 » Programs as polygraphs: computability and complexity |
SC
1991
ACM
15 years 1 months ago
1991
ACM
In cache based multiprocessors a protocol must maintain coherence among replicated copies of shared writable data. In delayed consistency protocols the effect of out-going and in-...
EUROPAR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Complex software systems use many shared libraries frequently composed of large off-the-shelf components. Only a limited number of functions are used from these shared li...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
109
click to vote
SOFTCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. An artificial neural network with all its elements is a rather complex structure, not easily constructed and/or trained to perform a particular task. Consequently, severa...
SC
2000
ACM
15 years 2 months ago
2000
ACM
Parallel programmers typically assume that all resources required for a program’s execution are dedicated to that purpose. However, in local and wide area networks, contention f...