3656 search results - page 249 / 732 » Compact Location Problems |
163
click to vote
ENTCS
2007
15 years 6 months ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...
152
click to vote
PR
2008
15 years 6 months ago
2008
This paper presents a new study on a method of designing a multi-class classifier: Data-driven Error Correcting Output Coding (DECOC). DECOC is based on the principle of Error Cor...
171
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
In designing a Bayesian network for an actual problem, developers need to bridge the gap between ematical abstractions offered by the Bayesian-network formalism and the features o...
143
click to vote
TCAD
2008
15 years 6 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
169
click to vote
JACM
2007
15 years 6 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...