2313 search results - page 40 / 463 » On Heuristic Time Hierarchies |
174
click to vote
GD
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
174
click to vote
AI
2004
Springer
15 years 6 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
183
click to vote
PG
1999
IEEE
15 years 10 months ago
1999
IEEE
Using object clusters for hierarchical radiosity greatly improves the efficiency and thus usability of radiosity computations. By eliminating the quadratic starting phase very lar...
181
click to vote
SIGMETRICS
2005
ACM
15 years 11 months ago
2005
ACM
The running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowled...
196
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...