3281 search results - page 361 / 657 » Bases for parametrized iterativity |
181
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
156
click to vote
ARITH
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper presents a new design and implementation of a 32-bit decimal floating-point (DFP) logarithmic converter based on the digit-recurrence algorithm. The converter can calc...
171
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
214
click to vote
IPSN
2009
Springer
16 years 1 months ago
2009
Springer
We present an algorithm for data delivery to mobile sinks in wireless sensor networks. Our algorithm is based on information potentials, which we extend to account for mobility. W...
174
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...