Sciweavers

499 search results - page 9 / 100
» Multilevel algorithms for linear ordering problems
Sort
View
97
Voted
VIS
2006
IEEE
122views Visualization» more  VIS 2006»
16 years 28 days ago
Representing Higher-Order Singularities in Vector Fields on Piecewise Linear Surfaces
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...
Wan-Chiu Li, Bruno Vallet, Nicolas Ray, Bruno L...
CORR
2006
Springer
144views Education» more  CORR 2006»
14 years 11 months ago
The minimum linear arrangement problem on proper interval graphs
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...
Ilya Safro
DAC
2008
ACM
15 years 1 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
CPAIOR
2006
Springer
15 years 3 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
83
Voted
FSTTCS
2007
Springer
15 years 5 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit