2714 search results - page 211 / 543 » Approximation Schemes for Scheduling |
146
click to vote
COR
2007
15 years 4 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
128
click to vote
INFORMS
2000
15 years 3 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
138
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
144
click to vote
ICIP
2006
IEEE
16 years 5 months ago
2006
IEEE
We present an algorithm for illumination invariant 3D model based tracking and video compression. While model-based coding schemes are well developed, the compression rate reduces...
115
click to vote
ACISP
2004
Springer
15 years 9 months ago
2004
Springer
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...