3874 search results - page 442 / 775 » Approximation Algorithms for k-hurdle Problems |
154
click to vote
ICANN
2007
Springer
16 years 24 days ago
2007
Springer
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
167
click to vote
COMPGEOM
2004
ACM
16 years 2 days ago
2004
ACM
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
167
click to vote
APPROX
2004
Springer
16 years 2 days ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
204
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
168
click to vote
IJCAI
2007
15 years 8 months ago
2007
Diagnosability of systems is an essential property that determines how accurate any diagnostic reasoning can be on a system given any sequence of observations. Generally, in the l...