12289 search results - page 576 / 2458 » computing 2006 |
184
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
203
click to vote
MSCS
2000
15 years 6 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
223
click to vote
EXPERT
2002
15 years 6 months ago
2002
Spatial reasoning is a major source of difficulties for strategy game AIs. We conjecture that qualitative spatial reasoning techniques can help overcome these difficulties. We bri...
165
click to vote
FUIN
2002
15 years 6 months ago
2002
Abstract. In this paper we give a complete formalization of a new computability model of a distributed parallel type which is inspired by some basic features of living cells: trans...
182
click to vote
FUIN
2002
15 years 6 months ago
2002
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...