1331 search results - page 182 / 267 » Complexity bounds for zero-test algorithms |
131
click to vote
OPODIS
2007
15 years 4 months ago
2007
This paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are...
129
click to vote
COMCOM
2004
15 years 3 months ago
2004
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
124
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
116
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
109
click to vote
MDM
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...