2485 search results - page 470 / 497 » Time Bounded Frequency Computations |
OPODIS
2007
13 years 9 months ago
2007
Considering an asynchronous system made up of n processes and where up to t of them can crash, finding the weakest assumptions that such a system has to satisfy for a common leade...
DAGSTUHL
2006
13 years 9 months ago
2006
This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degre...
SMA
2010
ACM
13 years 8 months ago
2010
ACM
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
IOR
2007
13 years 7 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
ETT
2002
13 years 7 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...