920 search results - page 156 / 184 » Generating Satisfiable Problem Instances |
TOMACS
2011
13 years 2 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Automatic recognition and formalization of constraints from free-form service requests is a challenging problem. Its resolution would go a long way toward allowing users to make r...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Scaling up to the enormous and growing Internet population with unpredictable usage patterns, Ecommerce applications face severe challenges in cost and manageability, especially f...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...