Sciweavers

903 search results - page 23 / 181
» Non-well-founded trees in categories
Sort
View
DOCENG
2007
ACM
15 years 3 months ago
A document object modeling method to retrieve data from a very large XML document
Document Object Modeling (DOM) is widely used approach for retrieving data from an XML document. If the size of the XML document is very large, however, using the DOM approach for...
Seung Min Kim, Suk I. Yoo, Eunji Hong, Tae Gwon Ki...
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
15 years 3 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 3 months ago
A tree-based genetic algorithm for building rectilinear Steiner arborescences
A rectilinear Steiner arborescence (RSA) is a tree, whose nodes include a prescribed set of points, termed the vertices, in the first quadrant of the Cartesian plane, and whose tr...
William A. Greene
76
Voted
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...
COMGEO
2004
ACM
14 years 11 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...