333 search results - page 63 / 67 » On the complexity of partial order trace model checking |
EUROCAST
2005
Springer
14 years 1 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
ODRL
2004
13 years 9 months ago
2004
Two main Rights Expression Languages (RELs) exist to describe licenses governing the access to digital content: ODRL (Open Digital Rights Language) and MPEG-21 REL. Both RELs are ...