70 search results - page 8 / 14 » Optimal reconstruction might be hard |
CHES
2007
Springer
15 years 3 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...
85
Voted
ILP
2007
Springer
15 years 3 months ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
SAINT
2006
IEEE
15 years 3 months ago
2006
IEEE
When a multitude of RFID tags are in the interrogating field, an anti-collision technology must be used. In literatures, the reading performance was mainly investigated on the er...
UIST
2006
ACM
15 years 3 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...