427 search results - page 41 / 86 » A Subexponential Bound for Linear Programming |
POPL
2009
ACM
14 years 8 months ago
2009
ACM
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
IWFM
2003
13 years 9 months ago
2003
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
AAAI
2008
13 years 10 months ago
2008
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. Although we have access to genotype data (gene...
ICLP
1997
Springer
13 years 12 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
ASPDAC
1998
ACM
13 years 12 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...