Sciweavers

14548 search results - page 53 / 2910
» The Optimal Path-Matching Problem
Sort
View
JCO
2002
96views more  JCO 2002»
13 years 9 months ago
On the Robust Single Machine Scheduling Problem
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
Jian Yang, Gang Yu
TSMC
2002
142views more  TSMC 2002»
13 years 9 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
13 years 5 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
SIAMJO
2010
89views more  SIAMJO 2010»
13 years 4 months ago
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...
Roberto Andreani, José Mario Martíne...
IPL
2010
74views more  IPL 2010»
13 years 8 months ago
The repeater tree construction problem
A tree-like substructure on a computer chip whose task it is to carry a signal from a source circuit to possibly many sink circuits and which consists only of wires and so-called ...
Christoph Bartoschek, Stephan Held, Jens Maß...