Sciweavers

2024 search results - page 211 / 405
» Improving quality, one process change at a time
Sort
View
TVLSI
2002
161views more  TVLSI 2002»
15 years 6 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
EOR
2006
118views more  EOR 2006»
15 years 6 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
AI
1998
Springer
15 years 6 months ago
A Complete Anytime Algorithm for Number Partitioning
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
Richard E. Korf
ICC
2011
IEEE
225views Communications» more  ICC 2011»
14 years 6 months ago
Throughput-Optimal Half-Duplex Cooperative Scheme with Partial Decode-Forward Relaying
Abstract—We study a cooperative communication system consisting of two users in half duplex mode communicating with one destination over additive white Gaussian noise (AWGN). Coo...
Ahmad Abu Al Haija, Mai Vu
ESTIMEDIA
2009
Springer
16 years 1 months ago
QoS management of dynamic video tasks by task splitting and skipping
—We have integrated processing with deterministic and non-deterministic resource usage in an overall application and evaluated its performance on a multi-core processor platform....
Rob Albers, Eric Suijs, Peter H. N. de With