Sciweavers

779 search results - page 31 / 156
» Spectral Generative Models for Graphs
Sort
View
COR
2007
79views more  COR 2007»
13 years 8 months ago
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
JMLR
2012
11 years 11 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
TCAD
2002
145views more  TCAD 2002»
13 years 8 months ago
Automatic generation of synthetic sequential benchmark circuits
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil
CSC
2006
13 years 9 months ago
Numerical Experiments on the Generation of Normal Mode Rossby Waves
s Normal mode Rossby waves are simulated with an efficient Double Fourier Series (DFS) spectral model, and their structures are investigated by the Empirical Orthogonal Function (E...
Hyeong-Bin Cheong, In-Hyuk Kwon
PARLE
1987
13 years 12 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop