Sciweavers

8413 search results - page 157 / 1683
» Ordering Problem Subgoals
Sort
View
HCI
2007
13 years 12 months ago
Towards Guidelines on Educational Podcasting Quality: Problems Arising from a Real World Experience
This paper presents an experience of educational podcasting set up at the University of Bergamo (Italy), and derives from that experience some remarks upon the quality of podcastin...
Marco Lazzari, Alberto Betella
JC
2007
63views more  JC 2007»
13 years 10 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
ICDM
2008
IEEE
175views Data Mining» more  ICDM 2008»
14 years 4 months ago
Overlapping Matrix Pattern Visualization: A Hypergraph Approach
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
Ruoming Jin, Yang Xiang, David Fuhry, Feodor F. Dr...
APPROX
2007
Springer
137views Algorithms» more  APPROX 2007»
14 years 4 months ago
A Knapsack Secretary Problem with Applications
We consider situations in which a decision-maker with a fixed budget faces a sequence of options, each with a cost and a value, and must select a subset of them online so as to ma...
Moshe Babaioff, Nicole Immorlica, David Kempe, Rob...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 3 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom