2702 search results - page 232 / 541 » Practically Applicable Formal Methods |
120
click to vote
JAIR
2010
15 years 23 days ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
112
click to vote
COMPSAC
2007
IEEE
15 years 8 months ago
2007
IEEE
Building open distributed systems is an even more challenging task than building distributed systems, as their components are loosely synchronised, can move, become disconnected, ...
137
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Object localization and classification are important problems in computer vision.
However, in many applications, exhaustive search over all class labels and image
locations is co...
169
click to vote
DAC
2006
ACM
16 years 3 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
108
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...