3946 search results - page 650 / 790 » The computational complexity of choice sets |
173
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
This paper describes an efficient and robust approach to provide a safe execution environment for an entire operating system, such as Linux, and all its applications. The approach...
160
click to vote
TACAS
2010
Springer
16 years 1 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
173
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
257
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
173
click to vote
RTCSA
2009
IEEE
16 years 1 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...