Sciweavers

982 search results - page 111 / 197
» Reduction Relations for Agent Models
Sort
View
SIROCCO
2004
15 years 2 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
BIOINFORMATICS
2007
195views more  BIOINFORMATICS 2007»
15 years 1 months ago
Context-dependent clustering for dynamic cellular state modeling of microarray gene expression
Motivation: High-throughput expression profiling allows researchers to study gene activities globally. Genes with similar expression profiles are likely to encode proteins that ma...
Shinsheng Yuan, Ker-Chau Li
DC
2008
15 years 1 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
123
Voted
PATAT
2004
Springer
150views Education» more  PATAT 2004»
15 years 6 months ago
Logistics Service Network Design for Time-Critical Delivery
Abstract. Service network design is critical to the profitability of express shipment carriers. In this paper, we consider the problem of designing the integrated service network ...
Cynthia Barnhart, Su Shen
145
Voted
CSFW
2002
IEEE
15 years 6 months ago
Capturing Parallel Attacks within the Data Independence Framework
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
Philippa J. Broadfoot, A. W. Roscoe