Sciweavers

1279 search results - page 144 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
EVOW
2009
Springer
15 years 8 months ago
Validation of a Morphogenesis Model of Drosophila Early Development by a Multi-objective Evolutionary Optimization Algorithm
We apply evolutionary computation to calibrate the parameters of a morphogenesis model of Drosophila early development. The model aims to describe the establishment of the steady g...
Rui Dilão, Daniele Muraro, Miguel Nicolau, ...
JAL
2007
95views more  JAL 2007»
15 years 1 months ago
Computing shortest paths with uncertainty
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
TWC
2008
238views more  TWC 2008»
15 years 1 months ago
Downlink resource allocation in multi-carrier systems: frequency-selective vs. equal power allocation
In this paper, a dynamic subcarrier and power allocation problem is considered in the context of asymptotic utility maximization in multi-carrier systems. Using the gradient-based...
Hyang-Won Lee, Song Chong
MOBIHOC
2010
ACM
14 years 12 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
MMAS
2011
Springer
14 years 4 months ago
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers
This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow th...
Björn Engquist, Lexing Ying