Sciweavers

874 search results - page 174 / 175
» Optimal Scheduling of Contract Algorithms for Anytime Proble...
Sort
View
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
TECS
2010
74views more  TECS 2010»
13 years 5 months ago
Recovering from distributable thread failures in distributed real-time Java
We consider the problem of recovering from failures of distributable threads (“threads”) in distributed realtime systems that operate under run-time uncertainties including th...
Edward Curley, Binoy Ravindran, Jonathan Stephen A...
IPPS
2009
IEEE
14 years 1 months ago
A resource allocation approach for supporting time-critical applications in grid environments
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
Qian Zhu, Gagan Agrawal
ICML
1999
IEEE
14 years 7 months ago
Least-Squares Temporal Difference Learning
Excerpted from: Boyan, Justin. Learning Evaluation Functions for Global Optimization. Ph.D. thesis, Carnegie Mellon University, August 1998. (Available as Technical Report CMU-CS-...
Justin A. Boyan
CVPR
2008
IEEE
14 years 9 months ago
Particle filtering for registration of 2D and 3D point sets with stochastic dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithm...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...