Sciweavers

5289 search results - page 659 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
AAAI
2006
15 years 8 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 7 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
DAM
1998
77views more  DAM 1998»
15 years 6 months ago
The Scheduling of Maintenance Service
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...
Shoshana Anily, Celia A. Glass, Refael Hassin
PC
1998
101views Management» more  PC 1998»
15 years 6 months ago
Performing Out-of Core FFTs on Parallel Disk Systems
The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering. Although most one-dimensional FFT problems canbe entirely solvedentirely ...
Thomas H. Cormen, David M. Nicol
GLOBECOM
2010
IEEE
15 years 4 months ago
Adaptive Modulation in Wireless Networks with Smoothed Flow Utility
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
Ekine Akuiyibo, Stephen P. Boyd, Daniel O'Neill