1120 search results - page 17 / 224 » time 1999 |
50
Voted
TIME
1999
IEEE
15 years 2 months ago
1999
IEEE
In the recent literature on time representation, an effort has been made to characterize the notion of time granularity and the relationships between granularities, in order to ha...
RANDOM
1999
Springer
15 years 2 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
91
Voted
ARTS
1999
Springer
15 years 2 months ago
1999
Springer
Program compilation can be formally defined as a sequence of equivalence-preserving transformations, or refinements, from highlevel language programs to assembler code. Recent mo...
RTCSA
1999
IEEE
15 years 2 months ago
1999
IEEE
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using ...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...