Sciweavers

2899 search results - page 110 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
DCC
2002
IEEE
16 years 1 months ago
Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams
In this paper, we present a family of new algorithms for rate-fidelity optimal packetization of scalable source bit streams with uneven error protection. In the most general settin...
Sorina Dumitrescu, Xiaolin Wu, Zhe Wang
IROS
2006
IEEE
111views Robotics» more  IROS 2006»
15 years 7 months ago
Optimization of Industrial Applications with Hardware in the Loop
This paper deals with optimizing the task cycle time of industrial robots integrated in complex robot cells. Trajectory optimizers are usually based on models and can’t properly...
Matthieu Guilbert, Pierre-Brice Wieber, Luc D. Jol...
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
15 years 7 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ICSE
1995
IEEE-ACM
15 years 5 months ago
A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies
Compilers and other programming environment tools derive information from the source code of programs; derived information includes compiled code, interprocedural summary informat...
Craig Chambers, Jeffrey Dean, David Grove
ATAL
2005
Springer
15 years 7 months ago
A decentralized bargaining protocol on dependent continuous multi-issue for approximate pareto optimal outcomes
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
Nicola Gatti, Francesco Amigoni