Sciweavers

3122 search results - page 120 / 625
» A Theory of Network Equivalence
Sort
View
CONCUR
2007
Springer
16 years 17 days ago
Coalgebraic Models for Reactive Systems
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
Filippo Bonchi, Ugo Montanari
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 17 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
TLCA
2005
Springer
15 years 12 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
FOCS
2003
IEEE
15 years 11 months ago
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
Martin Grohe
ACMICEC
2003
ACM
97views ECommerce» more  ACMICEC 2003»
15 years 11 months ago
Risk and user preferences in winner determination
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...
Güleser K. Demir, Maria L. Gini