Sciweavers

11151 search results - page 210 / 2231
» On the Complexity of Model Expansion
Sort
View
SCS
2004
15 years 8 months ago
Complex Reactive Real Time Systems and the Safety Case
Complex reactive real time systems are systems of systems that interact with the external world to perform selections of tasks in real time. They may be required to carry out sele...
Gordon R. Stone
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 7 months ago
Lower Bounds for the Complexity of Monadic Second-Order Logic
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
Stephan Kreutzer, Siamak Tazari
JETAI
2007
141views more  JETAI 2007»
15 years 7 months ago
Exchange market for complex commodities: search for optimal matches
The Internet has led to the development of on-line markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commo...
Eugene Fink, Jianli Gong, Josh Johnson
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
VMCAI
2010
Springer
16 years 4 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...