Sciweavers

500 search results - page 82 / 100
» Approximation algorithms for maximum independent set of pseu...
Sort
View
ANOR
2010
130views more  ANOR 2010»
14 years 11 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
15 years 10 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
COR
2011
14 years 8 months ago
Size-reduction heuristics for the unrelated parallel machines scheduling problem
In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job diļ¬...
Luis Fanjul-Peyro, Rubén Ruiz
IPMI
2003
Springer
16 years 2 months ago
Velocity Estimation in Ultrasound Images: A Block Matching Approach
In this paper, we focus on velocity estimation in ultrasound images sequences. Ultrasound images present many difficulties in image processing because of the typically high level o...
Djamal Boukerroui, J. Alison Noble, Michael Brady
CCCG
2007
15 years 3 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta