Sciweavers

1237 search results - page 111 / 248
» Abstract shade trees
Sort
View
JCB
1998
105views more  JCB 1998»
15 years 4 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
163
Voted
JIRS
2010
104views more  JIRS 2010»
15 years 3 months ago
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles
Abstract This paper presents a methodology based on a variation of the Rapidlyexploring Random Trees (RRTs) that generates feasible trajectories for a team of autonomous aerial veh...
Armando Alves Neto, Douglas Guimarães Macha...
MICS
2010
137views more  MICS 2010»
15 years 3 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
SSS
2010
Springer
103views Control Systems» more  SSS 2010»
15 years 3 months ago
A Provably Starvation-Free Distributed Directory Protocol
Abstract. This paper presents Combine, a distributed directory protocol for shared objects, designed for large-scale distributed systems. Directory protocols support move requests,...
Hagit Attiya, Vincent Gramoli, Alessia Milani
207
Voted
CC
2010
Springer
282views System Software» more  CC 2010»
15 years 3 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks