Sciweavers

53 search results - page 6 / 11
» Automatically Exploiting Subproblem Equivalence in Constrain...
Sort
View
POPL
2006
ACM
15 years 9 months ago
Simplifying reductions
We present optimization techniques for high level equational programs that are generalizations of affine control loops (ACLs). Significant parts of the SpecFP and PerfectClub benc...
Gautam Gupta, Sanjay V. Rajopadhye
85
Voted
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 1 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
PLDI
1997
ACM
15 years 1 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 2 months ago
Fault tolerant control allocation for a thruster-controlled floating platform using parametric programming
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
Jørgen Spjøtvold, Tor Arne Johansen
APLAS
2004
ACM
15 years 2 months ago
Network Fusion
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...
Pascal Fradet, Stéphane Hong Tuan Ha