Sciweavers

13306 search results - page 2238 / 2662
» Theoretical Computer Science
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
16 years 1 months ago
Online Occlusion Culling
Abstract. Modern computer graphics systems are able to render sophisticated 3D scenes consisting of millions of polygons. For most camera positions only a small collection of these...
Gereon Frahling, Jens Krokowski
GD
2005
Springer
16 years 1 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
16 years 1 months ago
Quality-time analysis of multi-objective evolutionary algorithms
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
Jian-Hung Chen, Shinn-Ying Ho, David E. Goldberg
MATES
2005
Springer
16 years 1 months ago
A Goal Deliberation Strategy for BDI Agent Systems
One aspect of rational behavior is that agents can pursue multiple goals in parallel. Current BDI theory and systems do not provide a theoretical or architectural framework for dec...
Alexander Pokahr, Lars Braubach, Winfried Lamersdo...
PCI
2005
Springer
16 years 1 months ago
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures
Cache misses form a major bottleneck for memory-intensive applications, due to the significant latency of main memory accesses. Loop tiling, in conjunction with other program tran...
Evangelia Athanasaki, Kornilios Kourtis, Nikos Ana...
« Prev « First page 2238 / 2662 Last » Next »