958 search results - page 88 / 192 » Resolving the Micropayment Problem |
105
Voted
AUTOMATICA
2006
15 years 27 days ago
2006
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
113
Voted
JAIR
2006
15 years 24 days ago
2006
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
130
Voted
ECCC
2007
15 years 24 days ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
AIR
2004
15 years 22 days ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
104
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...