504 search results - page 77 / 101 » The Complexity of Symmetry-Breaking Formulas |
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
VLSID
2002
IEEE
14 years 10 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
TACAS
2010
Springer
14 years 5 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
WWW
2009
ACM
14 years 4 months ago
2009
ACM
This paper presents an end-user-oriented programming environment called Mashroom. Major contributions herein include an end-user programming model with an expressive data structur...
LATA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We consider policies that are described by regular expressions, finite automata, or formulae of linear temporal logic (LTL). Such policies are assumed to describe situat...