Sciweavers

1888 search results - page 138 / 378
» Proof theory and computational analysis
Sort
View
135
Voted
LICS
1998
IEEE
15 years 4 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
103
Voted
BMCBI
2008
128views more  BMCBI 2008»
15 years 22 days ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 3 months ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
99
Voted
GROUP
1999
ACM
15 years 5 months ago
From description to requirements: an activity theoretic perspective
This paper demonstrates how activity theoretic concepts can be used in conjunction with an ethnographically informed approach to derive requirements on a work situation. We presen...
Phil Turner, Susan Turner, Julie Horton
C3S2E
2008
ACM
15 years 2 months ago
Evenness preserving operations on musical rhythms
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
Francisco Gomez-Martin, Perouz Taslakian, Godfried...