Sciweavers

778 search results - page 53 / 156
» Bounding Smooth Integers
Sort
View
MP
2006
119views more  MP 2006»
13 years 7 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 7 months ago
Large Nearly Regular Induced Subgraphs
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...
Noga Alon, Michael Krivelevich, Benny Sudakov
COCOON
2001
Springer
14 years 5 days ago
On-Line Variable Sized Covering
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
Leah Epstein
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
13 years 12 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
13 years 11 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris