Sciweavers

3894 search results - page 450 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 10 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
APPROX
2004
Springer
120views Algorithms» more  APPROX 2004»
15 years 10 months ago
Simultaneous Source Location
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...
Konstantin Andreev, Charles Garrod, Bruce M. Maggs...
AAIM
2008
Springer
94views Algorithms» more  AAIM 2008»
15 years 11 months ago
Speed Scaling with a Solar Cell
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
ICANN
2007
Springer
15 years 10 months ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
COMPGEOM
2004
ACM
15 years 10 months ago
A scalable simulator for forest dynamics
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...
Sathish Govindarajan, Mike Dietze, Pankaj K. Agarw...