Sciweavers

6045 search results - page 966 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
163
Voted
4OR
2006
100views more  4OR 2006»
15 years 6 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
IANDC
2008
80views more  IANDC 2008»
15 years 6 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
COR
2006
94views more  COR 2006»
15 years 6 months ago
A comparison of two different formulations for arc routing problems on mixed graphs
Arc Routing Problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing ...
Angel Corberán, Enrique Mota, José M...
ENTCS
2006
185views more  ENTCS 2006»
15 years 6 months ago
Time Domain Verification of Oscillator Circuit Properties
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
Goran Frehse, Bruce H. Krogh, Rob A. Rutenbar, Ode...
CAD
2007
Springer
15 years 6 months ago
Non-iterative approach for global mesh optimization
This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator ...
Ligang Liu, Chiew-Lan Tai, Zhongping Ji, Guojin Wa...