Sciweavers

1347 search results - page 160 / 270
» On the Structure of the Minimum Time Function
Sort
View
MST
2010
187views more  MST 2010»
14 years 11 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
COMPGEOM
2004
ACM
15 years 9 months ago
A computational framework for incremental motion
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
GECCO
2008
Springer
122views Optimization» more  GECCO 2008»
15 years 5 months ago
Varying portfolio construction of stocks using genetic network programming with control nodes
A new evolutionary method named “Genetic Network Programming with Control Nodes, GNPcn” has been proposed and applied to determine the timing of buying and selling stocks. GNP...
Etsushi Ohkawa, Yan Chen, Shingo Mabu, Kaoru Shima...
CSSC
2008
77views more  CSSC 2008»
15 years 4 months ago
Undercoverage of Wavelet-Based Resampling Confidence Intervals
The decorrelating property of the discrete wavelet transformation (DWT) appears valuable because one can avoid estimating the correlation structure in the original data space by b...
Liansheng Tang, Wayne A. Woodward, William R. Schu...
IS
2008
15 years 4 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth