3656 search results - page 194 / 732 » Compact Location Problems |
142
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
151
click to vote
CP
2007
Springer
16 years 12 days ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
172
click to vote
WADS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
201
click to vote
ISMB
1994
15 years 7 months ago
1994
The automatic generation of drawings of metabolic pathways is a challenging problem that depends intimately on exactly what information has been recorded for each pathway, and on ...
146
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
This paper studies the optimization of observation channels (stochastic kernels) in partially observed stochastic control problems. In particular, existence, continuity, and convex...