Sciweavers

28888 search results - page 46 / 5778
» Computability and complexity in analysis
Sort
View
CMSB
2009
Springer
14 years 2 months ago
Computing Reachable States for Nonlinear Biological Models
Abstract. In this paper we describe reachability computation for continuous and hybrid systems and its potential contribution to the process of building and debugging biological mo...
Thao Dang, Colas Le Guernic, Oded Maler
ECCC
2000
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
PODC
2012
ACM
11 years 10 months ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
CAD
2006
Springer
13 years 8 months ago
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
Stephane Redon, Ming C. Lin
COMPLEX
2009
Springer
14 years 2 months ago
Transforming Time Series into Complex Networks
We introduce transformations from time series data to the domain of complex networks which allow us to characterise the dynamics underlying the time series in terms of topological ...
Michael Small, Jie Zhang, Xiaoke Xu