Sciweavers

14386 search results - page 291 / 2878
» The Chinese Generals Problem
Sort
View
122
Voted
DIS
2003
Springer
15 years 10 months ago
Abduction and the Dualization Problem
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
Thomas Eiter, Kazuhisa Makino
163
Voted
ASIACRYPT
2001
Springer
15 years 8 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 7 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
WAOA
2005
Springer
104views Algorithms» more  WAOA 2005»
15 years 10 months ago
The Online Target Date Assignment Problem
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...
Stefan Heinz, Sven Oliver Krumke, Nicole Megow, J&...
CPAIOR
2008
Springer
15 years 6 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann