Sciweavers

1205 search results - page 97 / 241
» Efficient robust optimization for robust control with constr...
Sort
View
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 10 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
151
Voted
SAC
2004
ACM
15 years 11 months ago
LEMP: Lightweight Efficient Multicast Protocol for video on demand
In this paper, we propose a new scalable application-layer protocol, specifically designed for data streaming applications with large client sets. This is based upon a control hie...
Panayotis E. Fouliras, Spiros Xanthos, Nikolaos Ts...
121
Voted
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
15 years 11 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton
IJRR
2011
126views more  IJRR 2011»
15 years 23 days ago
Optimization and learning for rough terrain legged locomotion
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
Matthew Zucker, Nathan D. Ratliff, Martin Stolle, ...
145
Voted
SAC
2005
ACM
15 years 11 months ago
Efficient placement and routing in grid-based networks
This paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. Our system requires an extremely high level of ro...
Roozbeh Jafari, Foad Dabiri, Bo-Kyung Choi, Majid ...