Sciweavers

2509 search results - page 74 / 502
» Abstract Geometrical Computation and Computable Analysis
Sort
View
124
Voted
ENTCS
2007
158views more  ENTCS 2007»
15 years 19 days ago
Abstraction and Completeness for Real-Time Maude
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...
Peter Csaba Ölveczky, José Meseguer
106
Voted
POPL
1994
ACM
15 years 4 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
CSL
2007
Springer
15 years 6 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
82
Voted
ATAL
2008
Springer
15 years 2 months ago
Automated global-to-local programming in 1-D spatial multi-agent systems
A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial comp...
Daniel Yamins, Radhika Nagpal
ICALP
1992
Springer
15 years 4 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao