Sciweavers

269 search results - page 47 / 54
» Computational soundness of observational equivalence
Sort
View
EJC
2008
13 years 8 months ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
IOR
2010
99views more  IOR 2010»
13 years 6 months ago
Dynamic Pricing with a Prior on Market Response
We study a problem of dynamic pricing faced by a vendor with limited inventory, uncertain about demand, aiming to maximize expected discounted revenue over an infinite time horiz...
Vivek F. Farias, Benjamin Van Roy
SIAMSC
2010
119views more  SIAMSC 2010»
13 years 6 months ago
An Entropy Adjoint Approach to Mesh Refinement
This work presents a mesh refinement indicator based on entropy variables, with an application to the compressible Navier-Stokes equations. The entropy variables are shown to sati...
Krzysztof J. Fidkowski, Philip L. Roe
ASPLOS
2010
ACM
13 years 7 months ago
Best-effort semantic document search on GPUs
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Sr...
IEEEPACT
2008
IEEE
14 years 2 months ago
Skewed redundancy
Technology scaling in integrated circuits has consistently provided dramatic performance improvements in modern microprocessors. However, increasing device counts and decreasing o...
Gordon B. Bell, Mikko H. Lipasti