Sciweavers

14739 search results - page 248 / 2948
» An optimization problem on the sphere
Sort
View
JCO
2002
96views more  JCO 2002»
14 years 10 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»
14 years 10 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
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 5 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
DEXA
2004
Springer
131views Database» more  DEXA 2004»
15 years 4 months ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...
RTSS
2003
IEEE
15 years 4 months ago
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...
Dakai Zhu, Daniel Mossé, Rami G. Melhem