2526 search results - page 154 / 506 » A New Algorithm for Answer Set Computation |
179
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
177
click to vote
CHI
2006
ACM
16 years 6 months ago
2006
ACM
We introduce Peekaboom, an entertaining web-based game that can help computers locate objects in images. People play the game because of its entertainment value, and as a side eff...
184
click to vote
SOSP
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
193
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Since its inception, proteomics has essentially operated in a discovery mode with the goal of identifying and quantifying the maximal number of proteins in a sample. I...
164
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
As the speed gap between CPU and memory widens, memory hierarchy has become the primary factor limiting program performance. Until now, the principal focus of hardware and softwar...