Sciweavers

3625 search results - page 448 / 725
» On Timed Models of Gene Networks
Sort
View
PDPTA
2004
15 years 8 months ago
Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
FAC
2007
122views more  FAC 2007»
15 years 6 months ago
Formal techniques for performance analysis: blending SAN and PEPA
Abstract. In this paper we consider two performance modelling techniques from the perspectives of model construction, generation of an underlying continuous time Markov process, an...
Jane Hillston, Leïla Kloul
OR
2007
Springer
15 years 6 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
TCS
2008
15 years 6 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
INFOCOM
2000
IEEE
15 years 11 months ago
Quantifying the Benefit of Configurability in Circuit-Switched WDM Ring Networks
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
Brett Schein, Eytan Modiano