999 search results - page 43 / 200 » On the Decidability of Functional Uncertainty |
CPAIOR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
RANDOM
2001
Springer
14 years 1 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
ATAL
2006
Springer
14 years 13 days ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
SERVICES
2008
13 years 10 months ago
2008
Numerical simulators are frequently used to assess future risks, support remediation and monitoring program decisions, and assist in design of specific remedial actions with respe...
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. Moving objects produce trajectories, which are stored in databases by means of finite samples of time-stamped locations. When also speed limitations in these sample poin...