2124 search results - page 209 / 425 » Aggregating time partitions |
112
click to vote
SWAT
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. In a decision tree model, (n log2 n m i=1 ni log2 ni + n) is known to be a lower bound for sorting a multiset of size n containing m distinct elements, where the ith dist...
145
click to vote
ISSTA
1998
ACM
15 years 8 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
167
click to vote
SI3D
1995
ACM
15 years 8 months ago
1995
ACM
This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modi cation of Shadow Volume Binary Space...
137
click to vote
ECIR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional “resource ...
136
click to vote
PDPTA
2007
15 years 5 months ago
2007
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...