Sciweavers

804 search results - page 114 / 161
» On the Termination of the Chase Algorithm
Sort
View
98
Voted
IGPL
1998
97views more  IGPL 1998»
15 years 10 days ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
96
Voted
TSMC
1998
169views more  TSMC 1998»
15 years 9 days ago
Real-time map building and navigation for autonomous robots in unknown environments
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...
Giuseppe Oriolo, Giovanni Ulivi, Marilena Venditte...
73
Voted
TCS
2010
14 years 11 months ago
A trajectory-based strict semantics for program slicing
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
Richard W. Barraclough, David Binkley, Sebastian D...
WD
2010
14 years 10 months ago
Self-organized aggregation in irregular wireless networks
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Joanna Geibig, Dirk Bradler
MP
2011
14 years 7 months ago
Smoothed analysis of condition numbers and complexity implications for linear programming
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
John Dunagan, Daniel A. Spielman, Shang-Hua Teng