8824 search results - page 282 / 1765 » On the Complexity of Real Functions |
209
click to vote
IANDC
2007
15 years 6 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
207
click to vote
EVOW
2010
Springer
15 years 5 months ago
2010
Springer
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
177
click to vote
TPHOL
2005
IEEE
16 years 7 days ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
177
click to vote
IWLCS
2001
Springer
15 years 11 months ago
2001
Springer
In previous papers we have described the basic elements for building an economic model consisting of a group of artificial traders functioning and adapting in an environment conta...
155
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...