9412 search results - page 1860 / 1883 » An aspect-oriented generative approach |
151
click to vote
CORR
1999
Springer
14 years 11 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
103
click to vote
MP
2002
14 years 11 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
108
Voted
TCAD
1998
14 years 11 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
TKDE
1998
14 years 11 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
TRANSCI
1998
14 years 11 months ago
1998
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two ...