Sciweavers

8486 search results - page 22 / 1698
» Ordered Enumeration Method
Sort
View
CP
2005
Springer
16 years 8 hour ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
ANTS
2004
Springer
111views Algorithms» more  ANTS 2004»
15 years 12 months ago
A Method to Solve Cyclotomic Norm Equations
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
Nick Howgrave-Graham, Michael Szydlo
COCOA
2007
Springer
16 years 19 days ago
On Threshold BDDs and the Optimal Variable Ordering Problem
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...
Markus Behle
HYBRID
2007
Springer
16 years 19 days ago
A Partial Order Approach to Discrete Dynamic Feedback in a Class of Hybrid Systems
Abstract. We consider the dynamic feedback problem in a class of hybrid systems modeled as (infinite) state deterministic transition systems, in which the continuous variables are...
Domitilla Del Vecchio
CGO
2007
IEEE
16 years 24 days ago
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Emerging microprocessors offer unprecedented parallel computing capabilities and deeper memory hierarchies, increasing the importance of loop transformations in optimizing compile...
Louis-Noël Pouchet, Cédric Bastoul, Al...