Sciweavers

4218 search results - page 471 / 844
» Complete sets of cooperations
Sort
View
ISOLA
2010
Springer
15 years 6 months ago
Towards Dynamic Adaptation of Probabilistic Systems
Dynamic system adaptation is modeled in the coordination language Paradigm as coordination of collaborating components. A special component McPal allows for addition of new behavio...
Suzana Andova, Luuk Groenewegen, Erik P. de Vink
LOGCOM
2010
123views more  LOGCOM 2010»
15 years 6 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...
LPAR
2010
Springer
15 years 6 months ago
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order ...
Konstantin Korovin, Christoph Sticksel
MICS
2010
77views more  MICS 2010»
15 years 6 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
George B. Mertzios, Walter Unger
OL
2010
77views more  OL 2010»
15 years 6 months ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre