Sciweavers

1802 search results - page 41 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CSL
2007
Springer
15 years 11 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann
CORR
2002
Springer
87views Education» more  CORR 2002»
15 years 4 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
147
Voted
TPHOL
2005
IEEE
15 years 10 months ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
GEOS
2007
Springer
15 years 11 months ago
Supporting Complex Thematic, Spatial and Temporal Queries over Semantic Web Data
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...
Matthew Perry, Amit P. Sheth, Farshad Hakimpour, P...
EMSOFT
2004
Springer
15 years 10 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras