1710 search results - page 171 / 342 » Parallelism in Structured Newton Computations |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
ICDCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We introduce obstruction-freedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks,...
104
click to vote
PPSN
1998
Springer
15 years 2 months ago
1998
Springer
This paper describes a system for simulating the evolution of artificial 2D plant morphologies. Virtual plant genotypes are inspired by the mathematical formalism known as Lindenma...
104
click to vote
EUROPAR
2008
Springer
14 years 12 months ago
2008
Springer
Developing a distributed application for mobile resource constrained devices is a difficult and error-prone task that requires awareness of several system-level details (e.g., faul...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...