1081 search results - page 134 / 217 » Working with the LR Degrees |
102
Voted
GD
1997
Springer
15 years 4 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
94
Voted
ICCBR
1997
Springer
15 years 4 months ago
1997
Springer
Previous work on feature weighting for case-based learning algorithms has tended to use either global weights or weights that vary over extremely local regions of the case space. T...
PADS
1996
ACM
15 years 4 months ago
1996
ACM
One of the promises of parallelized discrete-event simulation is that it might provide significant speedups over sequential simulation. In reality, high performance cannot be achi...
71
Voted
STACS
1997
Springer
15 years 4 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
104
Voted
ISARCS
2010
15 years 4 months ago
2010
Abstract. Software designs equipped with specification of dependability techniques can help engineers to develop critical systems. In this work, we start to envision how a softwar...