Sciweavers

8810 search results - page 1665 / 1762
» Openness
Sort
View
146
Voted
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 3 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
126
Voted
CORR
2010
Springer
119views Education» more  CORR 2010»
15 years 3 months ago
Report on the XBase Project
This project addressed the conceptual fundamentals of data storage, investigating techniques for provision of highly generic storage facilities that can be tailored to produce var...
Evangelos Zirintsis, Graham N. C. Kirby, Alan Dear...
103
Voted
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 3 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 3 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
138
Voted
CORR
2010
Springer
186views Education» more  CORR 2010»
15 years 3 months ago
Capacitated Caching Games
Capacitated Caching (CC) Games are motivated by P2P and web caching applications, and involve nodes on a network making strategic choices regarding the content to replicate in the...
Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Na...
« Prev « First page 1665 / 1762 Last » Next »