Sciweavers

347 search results - page 8 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
CCGRID
2003
IEEE
15 years 2 months ago
An Agent Version of a Cluster Server
Agent-oriented software is promising improvements especially for the design of distributed systems. But currently, there is a substantial gap between the massive number of publica...
Andraz Bezek, Matjaz Gams
CIE
2006
Springer
14 years 11 months ago
Do Noetherian Modules Have Noetherian Basis Functions?
In Bishop-style constructive algebra it is known that if a module over a commutative ring has a Noetherian basis function, then it is Noetherian. Using countable choice we prove th...
Peter Schuster, Júlia Zappe
CCA
2009
Springer
15 years 4 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
SIGMOD
2005
ACM
157views Database» more  SIGMOD 2005»
15 years 9 months ago
Meta-data version and configuration management in multi-vendor environments
Nearly all components that comprise modern information technology, such as Computer Aided Software Engineering (CASE) tools, Enterprise Application Integration (EAI) environments,...
John R. Friedrich
106
Voted
SCP
1998
163views more  SCP 1998»
14 years 9 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat