Sciweavers

14704 search results - page 103 / 2941
» computing 2007
Sort
View
APAL
2006
123views more  APAL 2006»
15 years 2 months ago
The ibT degrees of computably enumerable sets are not dense
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.
George Barmpalias, Andrew E. M. Lewis
OTM
2007
Springer
15 years 9 months ago
Volunteer Computing, an Interesting Option for Grid Computing: Extremadura as Case Study
This paper presents the works done by several research groups from University of Extremadura and CETA-CIEMAT (Centro Extreme˜no de Tecnolog´ıas Avanzadas) in order to deploy an ...
Miguel Cárdenas Montes, Miguel A. Vega-Rodr...
RTCSA
2007
IEEE
15 years 9 months ago
MB++: An Integrated Architecture for Pervasive Computing and High-Performance Computing
MB++ is a system that caters to the dynamic needs of applications in a distributed, pervasive computing environment that has a wide variety of devices that act as producers and co...
David J. Lillethun, David Hilley, Seth Horrigan, U...
PAAPP
2007
115views more  PAAPP 2007»
15 years 2 months ago
Quantum computing: beyond the limits of conventional computation
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...
Marius Nagy, Selim G. Akl
CCCG
2006
15 years 4 months ago
On Computing Shortest External Watchman Routes for Convex Polygons
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
Rafa Absar, Sue Whitesides