Sciweavers

2100 search results - page 374 / 420
» Fundamentals of the problem
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
14 years 1 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
ATAL
2006
Springer
14 years 24 days ago
Deploying a personalized time management agent
We report on our ongoing practical experience in designing, implementing, and deploying PTIME, a personalized agent for time management and meeting scheduling in an open, multi-ag...
Pauline Berry, Bart Peintner, Ken Conley, Melinda ...
KR
2000
Springer
14 years 18 days ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 10 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
DAGSTUHL
1998
13 years 10 months ago
Markov Localization for Reliable Robot Navigation and People Detection
Localization is one of the fundamental problems in mobile robotics. Without knowledge about their position mobile robots cannot e ciently carry out their tasks. In this paper we pr...
Dieter Fox, Wolfram Burgard, Sebastian Thrun