Sciweavers

6598 search results - page 928 / 1320
» Graph Theory with Applications
Sort
View
PLDI
2004
ACM
16 years 9 days ago
Balancing register allocation across threads for a multithreaded network processor
+ Modern network processors employ multi-threading to allow concurrency amongst multiple packet processing tasks. We studied the properties of applications running on the network p...
Xiaotong Zhuang, Santosh Pande
194
Voted
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
16 years 2 days ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
CEEMAS
2001
Springer
15 years 11 months ago
UML for Behavior-Oriented Multi-agent Simulations
Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be...
Christoph Oechslein, Franziska Klügl, Rainer ...
194
Voted
SIGGRAPH
1997
ACM
15 years 11 months ago
Interactive Boolean operations for conceptual design of 3-D solids
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
Ari Rappoport, Steven N. Spitz
SPAA
1997
ACM
15 years 11 months ago
HARP: A Fast Spectral Partitioner
- Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (...
Horst D. Simon, Andrew Sohn, Rupak Biswas