4498 search results - page 153 / 900 » How to Invent Functions |
108
click to vote
ENTCS
2000
15 years 2 months ago
2000
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
116
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
138
Voted
COMBINATORICS
1999
15 years 2 months ago
1999
We find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to ext...
116
Voted
AUTOMATICA
2008
15 years 2 months ago
2008
In this paper we will extend the input-to-state stability (ISS) framework to continuous-time discontinuous dynamical systems (DDS) adopting piecewise smooth ISS Lyapunov functions...
123
Voted
GPEM
2006
15 years 2 months ago
2006
New Particle Swarm Optimization (PSO) methods for dynamic and noisy function optimization are studied in this paper. The new methods are based on the hierarchical PSO (H-PSO) and a...