Sciweavers

3082 search results - page 163 / 617
» New Bounds for the Controller Problem
Sort
View
AAAI
2000
15 years 5 months ago
Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
EOR
2007
104views more  EOR 2007»
15 years 4 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
TIP
1998
128views more  TIP 1998»
15 years 4 months ago
Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
This paper examines the relationship between wavelet-based image processing algorithms and variational problems. Algorithms are derived as exact or approximate minimizers of varia...
Antonin Chambolle, Ronald A. DeVore, Nam-Yong Lee,...
BC
2010
85views more  BC 2010»
15 years 1 months ago
Controlling precise movement with stochastic signals
In a noisy system, such as the nervous system, can movements be precisely controlled as experimentally demonstrated? We point out that the existing theory of motor control fails to...
Enrico Rossoni, Jing Kang, Jianfeng Feng
WAOA
2007
Springer
170views Algorithms» more  WAOA 2007»
15 years 10 months ago
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
José R. Correa, Cristina G. Fernandes, Mart...