Sciweavers

13621 search results - page 257 / 2725
» Computability and Complexity in Self-assembly
Sort
View
SAC
2010
ACM
16 years 1 months ago
Gray networking: a step towards next generation computer networks
Modern networks are very complex. It is highly desirable to reduce management complexity in next generation network design. Researchers have been seeking inspiration in natural ob...
Piyush Harsh, Randy Chow, Richard Newman
FDG
2009
ACM
16 years 1 months ago
Relating cognitive models of computer games to user evaluations of entertainment
As the interactive entertainment industry matures, a better understanding of what makes software entertaining is needed. A natural starting point is the application of traditional...
Paolo Piselli, Mark Claypool, James Doyle
IPPS
2003
IEEE
15 years 12 months ago
Loop Dissevering: A Technique for Temporally Partitioning Loops in Dynamically Reconfigurable Computing Platforms
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...
João M. P. Cardoso
165
Voted
ICS
2010
Tsinghua U.
15 years 11 months ago
Overlapping communication and computation by using a hybrid MPI/SMPSs approach
– Communication overhead is one of the dominant factors that affect performance in high-performance computing systems. To reduce the negative impact of communication, programmers...
Vladimir Marjanovic, Jesús Labarta, Eduard ...
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 8 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn