16844 search results - page 3107 / 3369 » How to Design Programs |
149
click to vote
ECCC
2007
15 years 6 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
194
click to vote
JOT
2006
15 years 6 months ago
2006
As a result of the increasing availability and processing capacity offered by portable devices, it is important for software providers to offer mobile services that seamlessly int...
214
click to vote
NETWORK
2008
15 years 6 months ago
2008
Consider a scenario where Jane is at an airport. She wants to find a restaurant with healthy food and short waiting time on the way to her terminal. The airport can provide such s...
169
click to vote
OCLC
2008
15 years 6 months ago
2008
Purpose of this paper By describing some of the often ignored aspects of repository advocacy, such as disciplinary differences and how these might affect the adoption of a particu...
172
click to vote
SIAMSC
2008
15 years 6 months ago
2008
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...