Sciweavers

4757 search results - page 818 / 952
» Monads for Functional Programming
Sort
View
CIA
2006
Springer
15 years 7 months ago
Conversation-Based Specification and Composition of Agent Services
There is great promise in the idea of having agent or web services available on the internet, that can be flexibly composed to achieve more complex services, which can themselves t...
Quoc Bao Vo, Lin Padgham
ECRTS
2004
IEEE
15 years 7 months ago
TLSF: A New Dynamic Memory Allocator for Real-Time Systems
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
Miguel Masmano, Ismael Ripoll, Alfons Crespo, Jorg...
CPM
2006
Springer
95views Combinatorics» more  CPM 2006»
15 years 7 months ago
New Bounds for Motif Finding in Strong Instances
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
Brona Brejová, Daniel G. Brown, Ian M. Harr...
DCOSS
2006
Springer
15 years 7 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
DIAGRAMS
2006
Springer
15 years 7 months ago
Flow Diagrams: Rise and Fall of the First Software Engineering Notation
Drawings of water are the earliest, least abstract forms of flow diagram. Representations of ideal or generalised sequences for manufacturing or actual paths for materials between ...
Stephen J. Morris, O. C. Z. Gotel