1776 search results - page 232 / 356 » Uncertain Linear Constraints |
204
Voted
COCOA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
194
click to vote
SAT
2007
Springer
16 years 1 months ago
2007
Springer
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
177
Voted
IROS
2006
IEEE
16 years 29 days ago
2006
IEEE
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
189
Voted
DFT
2005
IEEE
16 years 17 days ago
2005
IEEE
Data flow graph dominant designs, such as communication video and audio applications, are common in today’s IC industry. In these designs, the datapath resources (e.g., adders,...
196
Voted
IFIP
2005
Springer
16 years 14 days ago
2005
Springer
A new quasi-Newton scheme for updating a low rank positive semi-definite Hessian approximation is described, primarily for use in sequential quadratic programming methods for non...