Sciweavers

9405 search results - page 25 / 1881
» Computing a Model of Set Theory
Sort
View
105
Voted
GC
2004
Springer
15 years 8 months ago
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
Andrea Bracciali, Neophytos Demetriou, Ulrich Endr...
125
Voted
WWW
2002
ACM
16 years 3 months ago
Multimedia meets computer graphics in SMIL2.0: a time model for the web
Multimedia scheduling models provide a rich variety of tools for managing the synchronization of media like video and audio, but generally have an inflexible model for time itself...
Patrick Schmitz
115
Voted
ICAC
2007
IEEE
15 years 9 months ago
Approximation Modeling for the Online Performance Management of Distributed Computing Systems
—A promising method of automating management tasks in computing systems is to formulate them as control or optimization problems in terms of performance metrics. For an online op...
Dara Kusic, Nagarajan Kandasamy, Guofei Jiang
122
Voted
CSL
2010
Springer
15 years 3 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
121
Voted
APAL
1998
121views more  APAL 1998»
15 years 2 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...