Sciweavers

1095 search results - page 29 / 219
» Preprocessing of Intractable Problems
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson
MFCS
2004
Springer
14 years 1 months ago
Complexity of Decision Problems for Simple Regular Expressions
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
Wim Martens, Frank Neven, Thomas Schwentick
EUROCRYPT
2006
Springer
13 years 11 months ago
QUAD: A Practical Stream Cipher with Provable Security
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n <...
Côme Berbain, Henri Gilbert, Jacques Patarin
IJCAI
2001
13 years 9 months ago
An Improved Grid-Based Approximation Algorithm for POMDPs
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
Rong Zhou, Eric A. Hansen
IJNSEC
2008
103views more  IJNSEC 2008»
13 years 7 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao