Sciweavers

720 search results - page 95 / 144
» Linear k-arboricities on trees
Sort
View
EUROPAR
2008
Springer
13 years 11 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
VMV
2001
132views Visualization» more  VMV 2001»
13 years 11 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
IJCAI
1997
13 years 11 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
GLOBECOM
2008
IEEE
13 years 10 months ago
Many-to-Many Traffic Grooming in WDM Mesh Networks
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
Mohammad A. Saleh, Ahmed E. Kamal
ITSSA
2006
116views more  ITSSA 2006»
13 years 10 months ago
A Genetic Programming Approach to Automated Test Generation for Object-Oriented Software
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
Arjan Seesing, Hans-Gerhard Groß