817 search results - page 134 / 164 » Exact solutions to linear programming problems |
ASPDAC
2005
ACM
14 years 1 months ago
2005
ACM
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
CCE
2005
13 years 7 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
DISOPT
2007
13 years 7 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses the problem of inter-domain QoS routing. We propose a solution based on virtual-trunk type aggregates corresponding to Service Level Agreements (SLA) for d...
FPGA
1997
ACM
13 years 11 months ago
1997
ACM
We present a general approach to the FPGA technology mapping problem that applies to any logic block composed of lookup tables LUTs and can yield optimal solutions. The connecti...