Sciweavers

613 search results - page 28 / 123
» The Model-Summary Problem and a Solution for Trees
Sort
View
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 11 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
JCNS
2010
90views more  JCNS 2010»
13 years 2 months ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
CEC
2005
IEEE
14 years 29 days ago
Single parent genetic programming
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
Wendy Ashlock, Dan Ashlock
AUTOMATICA
2010
129views more  AUTOMATICA 2010»
13 years 7 months ago
Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control
The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multiagent control problems. In particular, we consider the pr...
Dimos V. Dimarogonas, Karl Henrik Johansson
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
14 years 21 days ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev