Sciweavers

2436 search results - page 416 / 488
» Comonadic Notions of Computation
Sort
View
WDAG
2009
Springer
160views Algorithms» more  WDAG 2009»
14 years 2 months ago
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems
This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-p...
Carole Delporte-Gallet, Hugues Fauconnier, Sam Tou...
HCW
2000
IEEE
14 years 2 months ago
Design of a Framework for Data-Intensive Wide-Area Applications
Applications that use collections of very large, distributed datasets have become an increasingly important part of science and engineering. With high performance wide-area networ...
Michael D. Beynon, Tahsin M. Kurç, Alan Sus...
ECOOP
1999
Springer
14 years 2 months ago
Object-Oriented Programming on the Network
Object-oriented programming techniques have been used with great success for some time. But the techniques of object-oriented programming have been largely confined to the single a...
Jim Waldo
AISB
1994
Springer
14 years 2 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
SIGGRAPH
1992
ACM
14 years 2 months ago
Re-tiling polygonal surfaces
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at var...
Greg Turk