8780 search results - page 273 / 1756 » On the Feasibility of Consistent Computations |
179
click to vote
GI
2007
Springer
15 years 11 months ago
2007
Springer
: The decomposition of planning and scheduling problems is a well known technique to make these problems tractable. The resulting dependable subproblems were often solved using dif...
205
click to vote
FPL
2009
Springer
15 years 11 months ago
2009
Springer
Preemptive multitasking, a popular technique for timesharing of computational resources in software-based systems, faces considerable difficulties when applied to partially reconf...
196
click to vote
AINTEC
2006
Springer
15 years 11 months ago
2006
Springer
In this paper, we will build a fault-tolerant network using a Multiple Care-of Addresses registration implementation on NEPL (NEMO Platform for Linux) for the GNU/Linux Operating S...
215
click to vote
DIS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Attribute value taxonomies (AVTs) have been used to perform AVT-guided decision tree learning on partially or totally missing data. In many cases, user-supplied AVTs are ...
189
click to vote
DSOM
2006
Springer
15 years 11 months ago
2006
Springer
Recent work on self-stabilizing routing in publish/subscribe systems showed that it is feasible to automate reconfigurations in case of faults by enabling the system to recover fro...