Sciweavers

1376 search results - page 237 / 276
» Searching Trees: An Essay
Sort
View
FSTTCS
2007
Springer
15 years 6 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 6 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks
MSN
2007
Springer
15 years 6 months ago
Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
Harri Haanpää, André Schumacher, ...
GLOBECOM
2006
IEEE
15 years 5 months ago
Building A Monitoring Overlay for Peer-to-Peer Streaming
— Current peer-to-peer (P2P) streaming systems often assume that nodes are cooperative to upload and download data. However, in the open environment of the Internet, this is not ...
Xing Jin, Qiuyan Xia, S.-H. Gary Chan
ICDM
2006
IEEE
153views Data Mining» more  ICDM 2006»
15 years 5 months ago
k-STARs: Sequences of Spatio-Temporal Association Rules
A Spatio-Temporal Association Rule (STAR) describes how objects move between regions over time. Since they describe only a single movement between two regions, it is very difficu...
Florian Verhein