Sciweavers

2777 search results - page 195 / 556
» Example centric programming
Sort
View
105
Voted
WOTUG
2008
15 years 2 months ago
Communicating Haskell Processes: Composable Explicit Concurrency using Monads
Writing concurrent programs in languages that lack explicit support for concurrency can often be awkward and difficult. Haskell's monads provide a way to explicitly specify se...
Neil C. C. Brown
77
Voted
WOA
2000
15 years 2 months ago
Mobile Applications in X-KLAIM
Networking has turned computers from isolated data processors into powerful communication and elaboration devices, called global computers; an illustrative example is the World
Lorenzo Bettini, Rocco De Nicola, Gian Luigi Ferra...
MST
2008
141views more  MST 2008»
15 years 23 days ago
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky
AMC
2005
195views more  AMC 2005»
15 years 22 days ago
A new symbolic computational approach to singular initial value problems in the second-order ordinary differential equations
This paper presents a new symbolic algorithm to compute the singular initial value problem of second-order ordinary differential equations using Adomian decomposition method. The ...
Onur Kiymaz, Seref Mirasyedioglu
83
Voted
AMC
2005
112views more  AMC 2005»
15 years 21 days ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang