Sciweavers

511 search results - page 41 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
87
Voted
COCOON
2006
Springer
15 years 1 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
NIPS
1997
14 years 11 months ago
Learning to Schedule Straight-Line Code
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
J. Eliot B. Moss, Paul E. Utgoff, John Cavazos, Do...
ATMOS
2007
163views Optimization» more  ATMOS 2007»
14 years 11 months ago
Branching Strategies to Improve Regularity of Crew Schedules in Ex-Urban Public Transit
We discuss timetables in ex-urban bus traffic that consist of many trips serviced every day together with some exceptions that do not repeat daily. Traditional optimization methods...
Ingmar Steinzen, Leena Suhl, Natalia Kliewer
MICCAI
2007
Springer
15 years 10 months ago
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
Tommy W. H. Tang, Albert C. S. Chung
RTS
2008
119views more  RTS 2008»
14 years 9 months ago
Symbolic quality control for multimedia applications
We present a fine grain quality control method for multimedia applications. The method takes as input an application software composed of actions. The execution times of actions a...
Jacques Combaz, Jean-Claude Fernandez, Joseph Sifa...