1686 search results - page 155 / 338 » Programs as polygraphs: computability and complexity |
121
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Virtual or in silico ligand screening combined with other computational methods is one of the most promising methods to search for new lead compounds, thereby greatly ...
148
Voted
SAC
2003
ACM
15 years 9 months ago
2003
ACM
An increasing interest in the design of mobile robots has been observed in recent years, which is mainly motivated by technological advances that may allow their application to co...
119
Voted
ICALP
1994
Springer
15 years 7 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
128
Voted
HPCA
2007
IEEE
16 years 4 months ago
2007
IEEE
With the advent of ubiquitous multi-core architectures, a major challenge is to simplify parallel programming. One way to tame one of the main sources of programming complexity, n...
135
Voted
IEEEPACT
2008
IEEE
15 years 10 months ago
2008
IEEE
We design and implement Mars, a MapReduce framework, on graphics processors (GPUs). MapReduce is a distributed programming framework originally proposed by Google for the ease of ...