Sciweavers

983 search results - page 93 / 197
» Negative-Weight Cycle Algorithms
Sort
View
ICRA
2000
IEEE
124views Robotics» more  ICRA 2000»
15 years 5 months ago
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
This paper deals with the Assembly Line Balancing Problem considering incompatibilities between the tasks with the aim of, first, minimizing the number of workstations and, then, ...
Joaquín Bautista, Raúl Suárez...
DATE
1999
IEEE
89views Hardware» more  DATE 1999»
15 years 5 months ago
A Methodology and Design Environment for DSP ASIC Fixed-Point Refinement
Complex signal processing algorithms are specified in floating point precision. When their hardware implementation requires fixed point precision, type refinement is needed. The p...
Radim Cmar, Luc Rijnders, Patrick Schaumont, Serge...
DAM
2008
92views more  DAM 2008»
15 years 1 months ago
Convex drawings of graphs with non-convex boundary constraints
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
Seok-Hee Hong, Hiroshi Nagamochi
DAM
2008
78views more  DAM 2008»
15 years 1 months ago
Semi-preemptive routing on trees
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
Sven Oliver Krumke, Dirk Räbiger, Rainer Schr...
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
15 years 6 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...