Sciweavers

2926 search results - page 298 / 586
» Partially Optimal Routing
Sort
View
GD
2000
Springer
15 years 7 months ago
Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
Therese C. Biedl, Torsten Thiele, David R. Wood
SC
2000
ACM
15 years 7 months ago
Tiling Optimizations for 3D Scientific Computations
Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show iterative solvers for partial differential equations (PDEs) i...
Gabriel Rivera, Chau-Wen Tseng
ECCV
2010
Springer
15 years 6 months ago
Learning PDEs for Image Restoration via Optimal Control
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
132
Voted
WSC
2008
15 years 6 months ago
Simulation optimization for industrial scheduling using hybrid genetic representation
Simulation modeling has the capability to represent complex real-world systems in details and therefore it is suitable to develop simulation models for generating detailed operati...
Marcus Andersson, Amos Ng, Henrik Grimm
177
Voted
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa