10848 search results - page 289 / 2170 » Programming in Biomolecular Computation |
165
click to vote
AIEDAM
2008
15 years 6 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
159
click to vote
CG
2000
Springer
15 years 5 months ago
2000
Springer
The Back of an Envelope project demonstrates how a calligraphic interface (one that employs a pen or stylus to input freehand drawing marks) can be used in a wide variety of domai...
153
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
180
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
177
click to vote
IPPS
2007
IEEE
16 years 9 days ago
2007
IEEE
We propose a two-layered approach for exploiting different forms of concurrency in complex systems: We specify computational components in our functional array language SaC, whic...