Sciweavers

817 search results - page 51 / 164
» Exact solutions to linear programming problems
Sort
View
AAAI
2007
13 years 11 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 2 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
INFOCOM
2006
IEEE
14 years 2 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
ALENEX
2009
106views Algorithms» more  ALENEX 2009»
13 years 10 months ago
Drawing Binary Tanglegrams: An Experimental Evaluation
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
Martin Nöllenburg, Markus Völker, Alexan...
JBCB
2010
123views more  JBCB 2010»
13 years 7 months ago
Characterizing the Space of interatomic Distance Distribution Functions Consistent with Solution Scattering Data
: Scattering of neutrons and x-rays from molecules in solution offers alternative approaches to the studying of a wide range of macromolecular structures in their solution state w...
Paritosh A. Kavathekar, Bruce A. Craig, Alan M. Fr...