Sciweavers

3224 search results - page 265 / 645
» Review of Affective Computing
Sort
View
WG
1995
Springer
15 years 8 months ago
Modular Decomposition of Hypergraphs
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
Paola Bonizzoni, Gianluca Della Vedova
POPL
2010
ACM
15 years 7 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
169
Voted
AAAI
2004
15 years 6 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
ERSA
2003
147views Hardware» more  ERSA 2003»
15 years 6 months ago
Towards Run-Time Re-Configurable Techniques for Real-Time Embedded Applications
Many embedded applications can benefit from the flexible custom computing opportunities that FPGA technology offers. The Run-Time Reconfiguration (RTR) of the FPGA as an applicati...
Timothy F. Oliver, Douglas L. Maskell
PDPTA
2003
15 years 6 months ago
HPJava: Programming Support for High-Performance Grid-Enabled Applications
The paper begins by considering what a Grid Computing Environment might be, why it is demanded, and how the authors’ HPspmd programming fits into this picture. We then review o...
Han-Ku Lee, Bryan Carpenter, Geoffrey Fox, Sang Bo...