Sciweavers

2413 search results - page 61 / 483
» Understanding the problem
Sort
View
COR
2006
138views more  COR 2006»
14 years 11 months ago
Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem
Over the last decade and a half, tabu search algorithms for machine scheduling have gained a near-mythical reputation by consistently equaling or establishing state-of-the-art per...
Jean-Paul Watson, Adele E. Howe, L. Darrell Whitle...
CORR
2007
Springer
98views Education» more  CORR 2007»
14 years 11 months ago
Realistic Rendering of Kinetostatic Indices of Mechanisms
: The work presented in this paper is related to the use of a haptic device in an environment of robotic simulation. Such device introduces a new approach to feel and to understand...
Damien Chablat, Fouad Bennis
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
15 years 15 days ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
GECCO
2009
Springer
146views Optimization» more  GECCO 2009»
15 years 5 months ago
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
Gabriela Ochoa, Rong Qu, Edmund K. Burke
KRDB
1994
78views Database» more  KRDB 1994»
15 years 14 days ago
The Problems of Data Modeling in Software Practice
This paper presents, fromthe author's perspective, the problems that occur in practice during data modelling. The author's experiences are a result of a considerable num...
Harald Huber