2038 search results - page 288 / 408 » Loops under Strategies |
142
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
114
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
120
click to vote
ESORICS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Privacy requirements have an increasing impact on the realization of modern applications. Technical considerations and many significant commercial and legal regulations ...
130
click to vote
EUC
2007
Springer
15 years 10 months ago
2007
Springer
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
121
click to vote
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...