Sciweavers

678 search results - page 74 / 136
» The Theory of Weak Stabilization
Sort
View
CP
2006
Springer
13 years 10 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
14 years 6 months ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
CCE
2004
13 years 8 months ago
On the use of reduced order models in bifurcation analysis of distributed parameter systems
Bifurcation theory provides a powerful tool for analyzing the nonlinear dynamic behavior of process systems. However, although the theory in principle applies to lumped as well as...
Yi Liu, Elling W. Jacobsen
LICS
2009
IEEE
14 years 3 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
SLE
2009
Springer
14 years 3 months ago
Ontological Metamodeling with Explicit Instantiation
Model Driven Engineering (MDE) is a promising paradigm for development. It raises the level of abstraction in software development by treating models as primary artifacts. The prac...
Alfons Laarman, Ivan Kurtev