Sciweavers

3591 search results - page 381 / 719
» Typing linear constraints
Sort
View
SAT
2007
Springer
95views Hardware» more  SAT 2007»
16 years 26 days ago
Solving Multi-objective Pseudo-Boolean Problems
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...
Martin Lukasiewycz, Michael Glaß, Christian ...
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
16 years 24 days ago
Computation reuse for rigid-body dynamics
— 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...
Anne Loomis, Devin J. Balkcom
DFT
2005
IEEE
83views VLSI» more  DFT 2005»
16 years 11 days ago
An ILP Formulation for Yield-driven Architectural Synthesis
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,...
Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
IFIP
2005
Springer
16 years 8 days ago
A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
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...
R. Fletcher
SPATIALCOGNITION
2004
Springer
16 years 3 days ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl