5055 search results - page 270 / 1011 » Relative Timing |
179
click to vote
STOC
1994
ACM
15 years 11 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
155
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
Generating semantic lexicons semiautomatically could be a great time saver, relative to creating them by hand. In this paper, we present an algorithm for extracting potential entr...
201
Voted
FAC
2000
15 years 6 months ago
2000
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
203
click to vote
ER
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Collections play an important part in everyday life. Therefore, conceptual data models should support collection types to make data modeling as natural as possible for it...
176
click to vote
SIGMETRICS
2004
ACM
16 years 14 days ago
2004
ACM
Fairness is a major issue in the operation of queues, perhaps it is the reason why queues were formed in the first place. Recent studies show that the fairness of a queueing syst...