Sciweavers

1058 search results - page 26 / 212
» It's Doomed; We Can Prove It
Sort
View
ENTCS
2007
112views more  ENTCS 2007»
13 years 9 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
IROS
2007
IEEE
99views Robotics» more  IROS 2007»
14 years 4 months ago
Robot coverage of terrain with non-uniform traversability
— In this paper, we study how multiple robots can cover known terrain quickly. We extend Multi-Robot Forest Coverage, a state-of-the-art multi-robot coverage algorithm, from terr...
Xiaoming Zheng, Sven Koenig
COMPOS
1997
Springer
14 years 2 months ago
Compositional Refinement of Interactive Systems Modelled by Relations
We introduce a mathematical model of components that can be used for the description of both hardware and software units forming distributed interactive systems. As part of a distr...
Manfred Broy
EUROCRYPT
2000
Springer
14 years 1 months ago
Propagation Characteristics and Correlation-Immunity of Highly Nonlinear Boolean Functions
We investigate the link between the nonlinearity of a Boolean function and its propagation characteristics. We prove that highly nonlinear functions usually have good propagation p...
Anne Canteaut, Claude Carlet, Pascale Charpin, Car...
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 10 months ago
A Dual Polynomial for OR
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
Robert Spalek