Sciweavers

2436 search results - page 50 / 488
» Comonadic Notions of Computation
Sort
View
CIE
2010
Springer
14 years 1 months ago
How Powerful Are Integer-Valued Martingales?
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
Laurent Bienvenu, Frank Stephan, Jason Teutsch
DAGSTUHL
2007
13 years 11 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...
LCPC
2005
Springer
14 years 3 months ago
Supporting SELL for High-Performance Computing
We briefly introduce the notion of Semantically Enhanced Library Languages, SELL, as a practical and economical alternative to special-purpose programming languages for high-perfo...
Bjarne Stroustrup, Gabriel Dos Reis
CGA
1999
13 years 9 months ago
Vector Geometry for Computer Graphics
translating your abstract notions of desired size and shape directly into the appropriate tugs and pulls. You would probably not think much about coordinate systems. Ifyouwantedtom...
James R. Miller
OOPSLA
2005
Springer
14 years 3 months ago
DOSC: dispersed operating system computing
Over the past decade the sheer size and complexity of traditional operating systems have prompted a wave of new approaches to help alleviate the services provided by these operati...
Ramesh K. Karne, Karthick V. Jaganathan, Nelson Ro...