Sciweavers

1083 search results - page 120 / 217
» On the Number of Optimal Base 2 Representations of Integers
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
JMLR
2010
129views more  JMLR 2010»
14 years 4 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
14 years 11 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
76
Voted
ICCAD
2002
IEEE
161views Hardware» more  ICCAD 2002»
15 years 6 months ago
Non-tree routing for reliability and yield improvement
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
Andrew B. Kahng, Bao Liu, Ion I. Mandoiu
CAISE
2004
Springer
15 years 3 months ago
Achieving Enterprise Model Interoperability through the Model-Based Architecture Framework for Enterprises
This paper describes an ontology for enterprise modelling, The ontology has enabled conceptual integration of two different modelling methodologies, one based on UEML (Unified Ente...
Håvard D. Jørgensen, Oddrun Pauline O...