Sciweavers

3228 search results - page 561 / 646
» Computationally Sound Proofs
Sort
View
IJCAI
2007
13 years 10 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
NIPS
2007
13 years 10 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
AAAI
2006
13 years 10 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
DICTA
2003
13 years 10 months ago
Globally Optimal Surfaces by Continuous Maximal Flows
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Ben Appleton, Hugues Talbot
FMOODS
2003
13 years 10 months ago
Inheritance of Temporal Logic Properties
Abstract. Inheritance is one of the key features for the success of objectoriented languages. Inheritance (or specialisation) supports incremental design and re-use of already writ...
Heike Wehrheim