Sciweavers

3359 search results - page 407 / 672
» A Simplified Idea Algorithm
Sort
View
99
Voted
SIGGRAPH
1996
ACM
15 years 4 months ago
Rendering Parametric Surfaces in Pen and Ink
This paper presents new algorithms and techniques for rendering parametric free-form surfaces in pen and ink. In particular, we introduce the idea of "controlled-density hatc...
Georges Winkenbach, David Salesin
DAC
1989
ACM
15 years 4 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
AAIM
2010
Springer
165views Algorithms» more  AAIM 2010»
15 years 4 months ago
Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
Christian Ernst, Changxing Dong, Gerold Jäger...
115
Voted
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
15 years 4 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
93
Voted
CSCLP
2006
Springer
15 years 4 months ago
Distributed Forward Checking May Lie for Privacy
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
Ismel Brito, Pedro Meseguer