934 search results - page 89 / 187 » exact 2007 |
131
click to vote
SOFSEM
2007
Springer
15 years 10 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
141
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
112
click to vote
SUM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
130
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
125
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...