Sciweavers

188 search results - page 15 / 38
» Back to the Complexity of Universal Programs
Sort
View
FLAIRS
2007
13 years 9 months ago
Performance Analysis of Evolutionary Search with a Dynamic Restart Policy
In this work we explore how the complexity of a problem domain affects the performance of evolutionary search using a performance-based restart policy. Previous research indicates...
Michael Solano, Istvan Jonyer
APSEC
2006
IEEE
14 years 1 months ago
Genericity - a "Missing in Action" Key to Software Simplification and Reuse
We hypothesize that certain program complexities and difficulties to realize reuse potentials have their roots in weak mechanisms for generic design of today’s programming techn...
Stan Jarzabek
ENTCS
2007
108views more  ENTCS 2007»
13 years 7 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
ASPLOS
2008
ACM
13 years 9 months ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...
ICALP
2010
Springer
13 years 9 months ago
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
Gossip protocols, also known as epidemic dissemination schemes, are becoming increasingly popular in distributed systems. Yet, it has remained a partially open question to determin...
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Mort...