Sciweavers

231 search results - page 33 / 47
» Stochastic Optimization is (Almost) as easy as Deterministic...
Sort
View
STACS
2005
Springer
14 years 2 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
WG
1993
Springer
14 years 23 days ago
Graphs, Hypergraphs and Hashing
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
HPDC
2006
IEEE
14 years 2 months ago
Replicating Nondeterministic Services on Grid Environments
Replication is a technique commonly used to increase the availability of services in distributed systems, including grid and web services. While replication is relatively easy for...
Xianan Zhang, Flavio Junqueira, Matti A. Hiltunen,...
MOBIHOC
2006
ACM
14 years 8 months ago
Data storage placement in sensor networks
Data storage has become an important issue in sensor networks as a large amount of collected data need to be archived for future information retrieval. This paper introduces stora...
Bo Sheng, Qun Li, Weizhen Mao
CJ
2004
141views more  CJ 2004»
13 years 8 months ago
Modeling and Analysis of a Scheduled Maintenance System: a DSPN Approach
This paper describes a way to manage the modeling and analysis of Scheduled Maintenance Systems (SMS) within an analytically tractable context. We chose a significant case study h...
Andrea Bondavalli, Roberto Filippini