Sciweavers

514 search results - page 6 / 103
» On enumerating all minimal solutions of feedback problems
Sort
View
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 5 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
ENTCS
2008
64views more  ENTCS 2008»
13 years 7 months ago
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
In this note we consider the computability of the solution of the initial-value problem for ordinary differential equations with continuous right-hand side. We present algorithms ...
Pieter Collins, Daniel S. Graça
ICPP
1990
IEEE
13 years 11 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin
ISLPED
2004
ACM
139views Hardware» more  ISLPED 2004»
14 years 24 days ago
Eliminating voltage emergencies via microarchitectural voltage control feedback and dynamic optimization
Microprocessor designers use techniques such as clock gating to reduce power dissipation. An unfortunate side-effect of these techniques is the processor current fluctuations th...
Kim M. Hazelwood, David Brooks
LCPC
2000
Springer
13 years 11 months ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips