Sciweavers

5064 search results - page 221 / 1013
» Recent Developments in Gridsolve
Sort
View
NETWORKS
2008
15 years 6 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
CCE
2004
15 years 6 months ago
Part II. Future perspective on optimization
Following from part I, which presents a retrospective on optimization, we focus here on areas that are recent active research topics and are likely to strongly influence the futur...
Ignacio E. Grossmann, Lorenz T. Biegler
CORR
2002
Springer
102views Education» more  CORR 2002»
15 years 6 months ago
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classificatio
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
Peter D. Turney
CGF
2010
141views more  CGF 2010»
15 years 3 months ago
A Survey of Procedural Noise Functions
Procedural noise functions are widely used in Computer Graphics, from off-line rendering in movie production to interactive video games. The ability to add complex and intricate d...
Ares Lagae, Sylvain Lefebvre, R. Cook, T. DeRose, ...
SIAMIS
2011
15 years 1 months ago
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Abstract. Accurate signal recovery or image reconstruction from indirect and possibly undersampled data is a topic of considerable interest; for example, the literature in the rece...
Stephen Becker, Jérôme Bobin, Emmanue...