2976 search results - page 177 / 596 » On the bounded integer programming |
168
click to vote
ASPLOS
2004
ACM
15 years 12 months ago
2004
ACM
Recent studies have suggested that the soft-error rate in microprocessor logic will become a reliability concern by 2010. This paper proposes an efficient error detection techniqu...
291
Voted
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
148
click to vote
VMCAI
2010
Springer
16 years 3 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
165
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
164
click to vote
APPML
2011
15 years 1 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...