Sciweavers

1998 search results - page 194 / 400
» Complexity of the Cover Polynomial
Sort
View
LICS
2006
IEEE
16 years 17 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
ATVA
2004
Springer
135views Hardware» more  ATVA 2004»
15 years 12 months ago
Using Block-Local Atomicity to Detect Stale-Value Concurrency Errors
Data races do not cover all kinds of concurrency errors. This paper presents a data-ow-based technique to nd stale-value errors, which are not found by low-level and high-level d...
Cyrille Artho, Klaus Havelund, Armin Biere
ECOOPW
2004
Springer
15 years 12 months ago
Coordination and Adaptation Techniques for Software Entities
Abstract. Coordination and Adaptation are two key issues when developing complex distributed systems. Coordination focuses on the interaction among computational entities. Adaptati...
Carlos Canal, Juan Manuel Murillo, Pascal Poizat
CGI
2004
IEEE
15 years 10 months ago
Fast Environmental Lighting for Local-PCA Encoded BTFs
Rendering geometric models with complex surface materials in arbitrary lighting environments is a challenging problem. In order to relight and render geometries covered with compl...
Gero Müller, Jan Meseth, Reinhard Klein
DEEC
2006
IEEE
15 years 10 months ago
A Bottom-Up Workflow Mining Approach for Workflow Applications Analysis
Abstract. Engineering workflow applications are becoming more and more complex, involving numerous interacting business objects within considerable processes. Analysing the interac...
Walid Gaaloul, Karim Baïna, Claude Godart