1263 search results - page 168 / 253 » A* with Bounded Costs |
149
click to vote
IEEEPACT
1998
IEEE
15 years 10 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
176
click to vote
IGIS
1994
15 years 10 months ago
1994
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
148
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In Computer Science, order is intimately related to sorting, commonly ...
171
click to vote
DAC
1995
ACM
15 years 9 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...
153
click to vote
WG
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. In this paper, we investigate which processor networks allow klabel Interval Routing Schemes, under the assumption that costs of edges may vary. We show that for each xed...