Sciweavers

74 search results - page 10 / 15
» The Cyclic Wirelength of Trees
Sort
View
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 4 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
AADEBUG
1997
Springer
14 years 2 months ago
Assertions for Dynamic Shape Analysis of List Data Structures
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
Mikhail Auguston, Miu Har Hon
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
14 years 6 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
TIC
2000
Springer
174views System Software» more  TIC 2000»
14 years 1 months ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
ICALP
1989
Springer
14 years 1 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano