Sciweavers

474 search results - page 53 / 95
» Computing integral solutions of complementarity problems
Sort
View
IPCO
2008
105views Optimization» more  IPCO 2008»
14 years 11 months ago
Can Pure Cutting Plane Algorithms Work?
We discuss an implementation of the lexicographic version of Gomory's fractional cutting plane method and of two heuristics mimicking the latter. In computational testing on a...
Arrigo Zanette, Matteo Fischetti, Egon Balas
DAC
2009
ACM
15 years 10 months ago
Contract-based system-level composition of analog circuits
Efficient system-level design is increasingly relying on hierarchical design-space exploration, as well as compositional methods, to shorten time-to-market, leverage design re-use...
Xuening Sun, Pierluigi Nuzzo, Chang-Ching Wu, Albe...
VLDB
2005
ACM
136views Database» more  VLDB 2005»
15 years 3 months ago
iMeMex: Escapes from the Personal Information Jungle
Modern computer work stations provide thousands of applications that store data in >100.000 files on the file system of the underlying OS. To handle these files data process...
Jens-Peter Dittrich, Marcos Antonio Vaz Salles, Do...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
14 years 7 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...
PODS
2011
ACM
201views Database» more  PODS 2011»
14 years 19 days ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...