3946 search results - page 251 / 790 » The computational complexity of choice sets |
348
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....
184
click to vote
CASES
2008
ACM
15 years 8 months ago
2008
ACM
fficient Programming Abstractions for Heterogeneous Multicore Systems on Chip Alastair D. Reid Krisztian Flautner Edmund Grimley-Evans ARM Ltd Yuan Lin University of Michigan The ...
184
click to vote
INFOCOM
2005
IEEE
16 years 9 days ago
2005
IEEE
— We consider a network of rechargeable sensors, deployed redundantly in a random sensing environment, and address the problem of how sensor nodes should be activated dynamically...
185
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
169
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...