4451 search results - page 391 / 891 » On Random Ordering Constraints |
178
click to vote
SAS
2007
Springer
16 years 28 days ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
200
click to vote
ATS
2005
IEEE
16 years 13 days ago
2005
IEEE
Power reduction during test application is important from the viewpoint of chip reliability and for obtaining correct test results. One of the ways to reduce scan test power is to...
210
click to vote
ICMCS
2005
IEEE
16 years 13 days ago
2005
IEEE
Sensor networks are usually dense networks where the network diversity can be exploited in order to overcome failures. In this paper, we study the use of multiple description tech...
202
click to vote
ICRA
2005
IEEE
16 years 12 days ago
2005
IEEE
— To close the loop between motion and vision, tracked visual features must remain in the camera field of view (visibility constraint). To overcome the visibility constraint, vi...
190
click to vote
CADE
2004
Springer
16 years 6 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...