Sciweavers

224 search results - page 45 / 45
» Auctions with Severely Bounded Communication
Sort
View
MP
2002
85views more  MP 2002»
13 years 5 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
JSAC
2010
135views more  JSAC 2010»
13 years 3 months ago
Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS
—Over the next decades, the Internet will evolve to support increasingly complex mission-critical services such as telerobotically controlled surgery. The world’s first telero...
T. H. Szymanski, D. Gilbert
JUCS
2010
124views more  JUCS 2010»
13 years 3 months ago
Performance Optimizations for DAA Signatures on Java enabled Platforms
: With the spreading of embedded and mobile devices, public-key cryptography has become an important feature for securing communication and protecting personal data. However, the c...
Kurt Dietrich, Franz Röck
TASE
2010
IEEE
13 years 1 days ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang