3934 search results - page 389 / 787 » Approximate Schedulability Analysis |
224
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
180
click to vote
TPDS
2002
15 years 6 months ago
2002
The problem of question/answering (Q/A) is to find answers to open-domain questions by searching large collections of documents. Unlike information retrieval systems, very common ...
208
click to vote
CC
2012
Springer
14 years 2 months ago
2012
Springer
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
159
click to vote
ISMB
1997
15 years 8 months ago
1997
We present a system of programs designed to facilitate sequence analysis projects involving large amounts of data. SEALS (System for Easy Analysis of Lots of Sequences) is a logic...
179
click to vote
EUROMICRO
2005
IEEE
16 years 12 days ago
2005
IEEE
Code revision of a leading telecom product was performed, combining manual audit and static analysis tools. On average, one exploitable vulnerability was found for every 4000 line...