Sciweavers

2479 search results - page 153 / 496
» A Computational Theory of Working Memory
Sort
View
ANCS
2009
ACM
13 years 7 months ago
Range Tries for scalable address lookup
In this paper we introduce the Range Trie, a new multiway tree data structure for address lookup. Each Range Trie node maps to an address range [Na, Nb) and performs multiple comp...
Ioannis Sourdis, Georgios Stefanakis, Ruben de Sme...
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 2 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
CGO
2006
IEEE
14 years 3 months ago
Compiler-directed Data Partitioning for Multicluster Processors
Multicluster architectures overcome the scaling problem of centralized resources by distributing the datapath, register file, and memory subsystem across multiple clusters connec...
Michael L. Chu, Scott A. Mahlke
ACMDIS
2006
ACM
14 years 3 months ago
How do design and evaluation interrelate in HCI research?
Human-Computer Interaction (HCI) is defined by the Association for Computing Machinery (ACM) Special Interest Group on Computer-Human Interaction (SIGCHI) as “a discipline conce...
Christine E. Wania, Michael E. Atwood, Katherine W...
IMR
1999
Springer
14 years 1 months ago
Parallel Advancing Front Grid Generation
The primary focus of this project is to design and implement a parallel framework for an unstructured mesh generator based on the advancing front method (AFM). In particular, we t...
Rainald Löhner, Juan R. Cebral