18306 search results - page 275 / 3662 » Algorithmics in Exponential Time |
201
click to vote
ETFA
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
184
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this pape...
159
Voted
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
167
Voted
CRYPTO
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
171
click to vote
SC
1993
ACM
15 years 10 months ago
1993
ACM
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...