Sciweavers

1450 search results - page 162 / 290
» On the Complexity of Hardness Amplification
Sort
View
GI
2009
Springer
14 years 1 months ago
Massively-Parallel Simulation of Biochemical Systems
: Understanding biological evolution prompts for a detailed understanding of the realized phenotype. Biochemical and gene regulatory dynamics are a cornerstone for the physiology o...
Jens Ackermann, Paul Baecher, Thorsten Franzel, Mi...
MODELS
2009
Springer
14 years 1 months ago
An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example
Abstract. Predefined composite operations are handy for efficient modeling, e.g., for the automatic execution of refactorings, and for the introduction of patterns in existing mod...
Petra Brosch, Philip Langer, Martina Seidl, Konrad...
ALT
2001
Springer
14 years 1 months ago
Learning Coherent Concepts
We develop a theory for learning scenarios where multiple learners co-exist but there are mutual compatibility constraints on their outcomes. This is natural in cognitive learning...
Ashutosh Garg, Dan Roth
PAPM
2001
Springer
107views Mathematics» more  PAPM 2001»
14 years 1 months ago
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter ...
TACS
2001
Springer
14 years 1 months ago
The UDP Calculus: Rigorous Semantics for Real Networking
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...
Andrei Serjantov, Peter Sewell, Keith Wansbrough