Sciweavers

732 search results - page 20 / 147
» Termination of Integer Linear Programs
Sort
View
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 2 months ago
Integer Polyhedra for Program Analysis
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
Philip J. Charles, Jacob M. Howe, Andy King
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
14 years 1 months ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra
ORL
2008
111views more  ORL 2008»
13 years 7 months ago
Certificates of linear mixed integer infeasibility
A central result in the theory of integer optimization states that a system of linear diophantine equations Ax = b has no integral solution if and only if there exists a vector in...
Kent Andersen, Quentin Louveaux, Robert Weismantel
COR
2006
86views more  COR 2006»
13 years 7 months ago
Parametric tabu-search for mixed integer programs
A parametric form of tabu-search is proposed for solving mixed integer programming (MIP) problems that creates and solves a series of linear programming (LP) problems embodying br...
Fred Glover
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 1 months ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak