Sciweavers

6315 search results - page 397 / 1263
» Approximating Solution Structure
Sort
View
185
Voted
AIPR
2005
IEEE
16 years 15 days ago
Discretization Error Based Mesh Generation for Diffuse Optical Tomography
In this paper, we analyze the perturbation in the reconstructed optical absorption images, resulting from the discretization of the forward and inverse problems. We show that the ...
Murat Guven, Birsen Yazici, Kiwoon Kwon, Eldar Gil...
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 11 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
199
Voted
CISS
2007
IEEE
15 years 10 months ago
Channel-Adaptive Optimal OFDMA Scheduling
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...
Xin Wang, Georgios B. Giannakis, Yingqun Yu
ECML
2007
Springer
15 years 10 months ago
Efficient Continuous-Time Reinforcement Learning with Adaptive State Graphs
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
Gerhard Neumann, Michael Pfeiffer, Wolfgang Maass
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 10 months ago
Tight Results on Minimum Entropy Set Cover
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
Jean Cardinal, Samuel Fiorini, Gwenaël Joret