6315 search results - page 373 / 1263 » Approximating Solution Structure |
177
click to vote
SIROCCO
2010
15 years 8 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
195
click to vote
BMCBI
2008
15 years 7 months ago
2008
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
189
click to vote
IJAR
2008
15 years 6 months ago
2008
Cooperative multiagent probabilistic inference can be applied in areas such as building surveillance and complex system diagnosis to reason about the states of the distributed unc...
184
click to vote
IJRR
2007
15 years 6 months ago
2007
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
225
click to vote
CGF
2007
15 years 6 months ago
2007
We present a novel framework for efficiently computing the indirect illumination in diffuse and moderately glossy scenes using density estimation techniques. Many existing global...