1204 search results - page 99 / 241 » Termination of Polynomial Programs |
109
Voted
ATMOS
2007
15 years 2 months ago
2007
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
95
Voted
CORR
2008
Springer
15 years 23 days ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
113
click to vote
ICFP
2006
ACM
16 years 20 days ago
2006
ACM
We describe an s-expression based syntax-extension framework much like Scheme macros, with a key additional facility: the ability to define static semantics, such as type systems ...
111
Voted
CSFW
1997
IEEE
15 years 5 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
100
Voted
APLAS
2007
ACM
15 years 4 months ago
2007
ACM
We propose a series of type systems for the information-flow security of assembly code. These systems extend previous work TALC with some timing annotations and associated judgment...