Sciweavers

252 search results - page 9 / 51
» On partitions of discrete boxes
Sort
View
ISPD
1999
ACM
79views Hardware» more  ISPD 1999»
13 years 12 months ago
Partitioning with terminals: a "new" problem and new benchmarks
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
Charles J. Alpert, Andrew E. Caldwell, Andrew B. K...
ASPDAC
2005
ACM
98views Hardware» more  ASPDAC 2005»
13 years 9 months ago
Online hardware/software partitioning in networked embedded systems
Abstract— Today’s embedded systems are typically distributed and more often confronted with timevarying demands. Existing methodologies that optimize the partitioning of comput...
Thilo Streichert, Christian Haubelt, Jürgen T...
SIAMSC
2008
92views more  SIAMSC 2008»
13 years 7 months ago
On Multisymplecticity of Partitioned Runge-Kutta Methods
Previously, it has been shown that discretising a multi-Hamiltonian PDE in space and time with partitioned Runge
Brett N. Ryland, Robert I. McLachlan
ICML
2005
IEEE
14 years 8 months ago
Computational aspects of Bayesian partition models
The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost...
Mikko Koivisto, Kismat Sood
COMPGEOM
2009
ACM
14 years 2 months ago
Binary plane partitions for disjoint line segments
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...
Csaba D. Tóth