Sciweavers

988 search results - page 88 / 198
» Pseudo-Genetic Algorithmic Composition
Sort
View
DSN
2005
IEEE
15 years 3 months ago
Lumping Matrix Diagram Representations of Markov Models
Continuous-time Markov chains (CTMCs) have been used successfully to model the dependability and performability of many systems. Matrix diagrams (MDs) are known to be a space-efļ¬...
Salem Derisavi, Peter Kemper, William H. Sanders
FASE
2004
Springer
15 years 3 months ago
Checking Absence of Illicit Applet Interactions: A Case Study
Abstract. This paper presents the use of a method – and its corresponding tool set – for compositional verification of applet interactions on a realistic industrial smart card...
Marieke Huisman, Dilian Gurov, Christoph Sprenger,...
LCN
2003
IEEE
15 years 3 months ago
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet sch...
Fariza Sabrina, Sanjay Jha
CPAIOR
2010
Springer
15 years 2 months ago
Constraint-Based Local Search for Constrained Optimum Paths Problems
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
Pham Quang Dung, Yves Deville, Pascal Van Hentenry...
PVLDB
2008
103views more  PVLDB 2008»
14 years 9 months ago
A request-routing framework for SOA-based enterprise computing
Enterprises may use a service-oriented architecture (SOA) to provide a streamlined interface to their business processes. To scale up the system, each tier in a composite service ...
Thomas Phan, Wen-Syan Li