1368 search results - page 148 / 274 » Avoiding Simplicity Is Complex |
CAV
2009
Springer
14 years 10 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
HPCA
2008
IEEE
14 years 10 months ago
2008
IEEE
Serializing instructions (SIs), such as writes to control registers, have many complex dependencies, and are difficult to execute out-of-order (OoO). To avoid unnecessary complexi...
OSDI
2004
ACM
14 years 10 months ago
2004
ACM
FFPF is a network monitoring framework designed for three things: speed (handling high link rates), scalability (ability to handle multiple applications) and flexibility. Multiple...
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
ICRA
2009
IEEE
14 years 5 months ago
2009
IEEE
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...