Sciweavers

15485 search results - page 314 / 3097
» Computing Optimal Subsets
Sort
View
COMPGEOM
1999
ACM
15 years 11 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
ISCA
1995
IEEE
118views Hardware» more  ISCA 1995»
15 years 10 months ago
The EM-X Parallel Computer: Architecture and Basic Performance
Latency tolerance is essential in achieving high performance on parallel computers for remote function calls and fine-grained remote memory accesses. EM-X supports interprocessor ...
Yuetsu Kodama, Hirohumi Sakane, Mitsuhisa Sato, Ha...
AAAI
2008
15 years 9 months ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...
CASES
2008
ACM
15 years 8 months ago
Dynamic coprocessor management for FPGA-enhanced compute platforms
Various commercial programmable compute platforms have their processor architecture enhanced with field-programmable gate arrays (FPGAs). In a common usage scenario, an applicatio...
Chen Huang, Frank Vahid
GECCO
2008
Springer
149views Optimization» more  GECCO 2008»
15 years 7 months ago
Real-time imitation-based adaptation of gaming behaviour in modern computer games
In the course of the recent complexification and sophistication of commercial computer games, the creation of competitive artificial players that are able to behave intelligentl...
Steffen Priesterjahn, Alexander Weimer, Markus Ebe...