1195 search results - page 172 / 239 » New constructions of SSPDs and their applications |
EUROPAR
2009
Springer
15 years 2 months ago
2009
Springer
The paper presents a new data partitioning algorithm for parallel computing on heterogeneous processors. Like traditional functional partitioning algorithms, the algorithm assumes ...
105
click to vote
COCOON
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
The paper describes main features of an Intelligent Scheduler for Road Transportation Applications based on Magenta agent technology and characterized by a number of unique, advan...
100
click to vote
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
VISUALIZATION
1995
IEEE
15 years 1 months ago
1995
IEEE
In the research described here, we have constructed at tightly coupled set of methods for monitoring, steering, and applying visual analysis to large scale simulations. This work ...