2131 search results - page 281 / 427 » Immunity for Closed Sets |
148
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
194
click to vote
ITC
1993
IEEE
15 years 10 months ago
1993
IEEE
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
223
click to vote
CAV
1994
Springer
15 years 10 months ago
1994
Springer
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a...
165
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...
130
click to vote
AOSD
2007
ACM
15 years 10 months ago
2007
ACM
Design patterns aim at improving reusability and variability of object-oriented software. Despite a notable success, aspect-oriented programming (AOP) has been discussed recently ...