Sciweavers

1920 search results - page 241 / 384
» The Range Constraint: Algorithms and Implementation
Sort
View
ICNP
2005
IEEE
16 years 7 days ago
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While i...
Hongbo Jiang, Shudong Jin
SIGCOMM
2005
ACM
16 years 6 days ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
ICCSA
2005
Springer
16 years 5 days ago
An Economic Capacity Planning Model Considering Inventory and Capital Time Value
Abstract. A company needs to implement several make-to-stock policies apart from a regular make-to-order production, so that the capacity of expensive resources can be fully utiliz...
S. Michael Wang, Kung-Jeng Wang, Hui-Ming Wee, J. ...
EUROPAR
2009
Springer
15 years 11 months ago
Real-Time Issues in Live Migration of Virtual Machines
This paper addresses the issue of how to meet the strict timing constraints of (soft) real-time virtualized applications while the Virtual Machine (VM) hosting them is undergoing a...
Fabio Checconi, Tommaso Cucinotta, Manuel Stein
ICCAD
1999
IEEE
125views Hardware» more  ICCAD 1999»
15 years 11 months ago
Direct synthesis of timed asynchronous circuits
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
Sung Tae Jung, Chris J. Myers