914 search results - page 128 / 183 » The Computational Complexity of Probabilistic Planning |
CRYPTO
2006
Springer
14 years 20 days ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
APVIS
2010
13 years 10 months ago
2010
Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis h...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
VLDB
2001
ACM
14 years 1 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....