Sciweavers

188 search results - page 12 / 38
» A new meta-method for graph partitioning
Sort
View
JMLR
2012
11 years 10 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
COMBINATORICA
2011
12 years 7 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
EOR
2006
57views more  EOR 2006»
13 years 8 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
SIES
2007
IEEE
14 years 2 months ago
Novel Genome Coding of Genetic Algorithms for the System Partitioning Problem
— The research field of partitioning for electronic systems started to attract significant attention of scientists about fifteen years ago. Gaining ever more importance due to...
Bastian Knerr, Martin Holzer 0002, Markus Rupp
IPPS
2006
IEEE
14 years 1 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...