Sciweavers

4539 search results - page 893 / 908
» Approaches to Compute Workflow Complexity
Sort
View
93
Voted
APLAS
2007
ACM
15 years 1 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
ATAL
2006
Springer
15 years 1 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
ICALP
2000
Springer
15 years 1 months ago
Scalable Secure Storage when Half the System Is Faulty
In this paper, we provide a method to safely store a document in perhaps the most challenging settings, a highly decentralized replicated storage system where up to half of the st...
Noga Alon, Haim Kaplan, Michael Krivelevich, Dahli...
MICCAI
2000
Springer
15 years 1 months ago
Motion-Based Robotic Instrument Targeting under C-Arm Fluoroscopy
: We present a simple and precise robot targeting method under portable x-ray fluoroscopy based on image servoing. The method is implemented for needle alignment in percutaneous pr...
Alexandru Patriciu, Dan Stoianovici, Louis L. Whit...
NGC
2000
Springer
15 years 1 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi