Sciweavers

5084 search results - page 389 / 1017
» Proving Possibility Properties
Sort
View
ISPD
1998
ACM
101views Hardware» more  ISPD 1998»
15 years 11 months ago
Greedy wire-sizing is linear time
—The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this...
Chris C. N. Chu, D. F. Wong
ICALP
1998
Springer
15 years 11 months ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
ROBOCUP
1998
Springer
101views Robotics» more  ROBOCUP 1998»
15 years 11 months ago
Evolving Team Darwin United
The RoboCup simulator competition is one of the most challenging international proving grounds for contemporary AI research. Exactly because of the high level of complexity and a l...
David Andre, Astro Teller
CDB
1997
Springer
85views Database» more  CDB 1997»
15 years 11 months ago
On Expressing Topological Connectivity in Spatial Datalog
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
Bart Kuijpers, Marc Smits
TYPES
1994
Springer
15 years 11 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson