Sciweavers

2796 search results - page 517 / 560
» The coolest path problem
Sort
View
DBPL
1997
Springer
87views Database» more  DBPL 1997»
15 years 4 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong
TAPSOFT
1997
Springer
15 years 4 months ago
An Applicative Module Calculus
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
Judicaël Courant
ICRA
1994
IEEE
89views Robotics» more  ICRA 1994»
15 years 4 months ago
Computation of Shape Through Controlled Active Exploration
Accurate knowledge of depth continues to be of critical importance in robotic systems. Without accurate depth knowledge, tasks such as inspection, tracking, grasping, and collisio...
Christopher E. Smith, Nikolaos Papanikolopoulos
ESA
1994
Springer
138views Algorithms» more  ESA 1994»
15 years 4 months ago
Efficient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
Sunil Arya, Michiel H. M. Smid
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
15 years 3 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...