Sciweavers

422 search results - page 39 / 85
» On Non-Approximability for Quadratic Programs
Sort
View
DATE
2007
IEEE
98views Hardware» more  DATE 2007»
14 years 2 months ago
Simulation-based reusable posynomial models for MOS transistor parameters
We present an algorithm to automatically design posynomial models for parameters of the MOS transistors using simulation data. These models improve the accuracy of the Geometric P...
Varun Aggarwal, Una-May O'Reilly
TCS
2008
13 years 8 months ago
Expanders and time-restricted branching programs
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
Stasys Jukna
GG
2004
Springer
14 years 1 months ago
Towards Graph Programs for Graph Algorithms
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
Detlef Plump, Sandra Steinert
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
14 years 23 days 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
EUROGP
2000
Springer
115views Optimization» more  EUROGP 2000»
13 years 11 months ago
Evolution of a Controller with a Free Variable Using Genetic Programming
A mathematical formula containing one or more free variables is "general" in the sense that it provides a solution to an entire category of problems. For example, the fa...
John R. Koza, Jessen Yu, Martin A. Keane, William ...