3082 search results - page 67 / 617 » New Bounds for the Controller Problem |
132
click to vote
ECOOP
2006
Springer
15 years 7 months ago
2006
Springer
The integration of aspects into the methodology of stepwise software development and evolution is still an open issue. This paper focuses on the global quantification mechanism of...
131
click to vote
CRYPTO
2008
Springer
15 years 5 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
128
click to vote
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
115
Voted
JAIR
2008
15 years 3 months ago
2008
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
118
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...