Sciweavers

8259 search results - page 1433 / 1652
» On Generalized Feistel Networks
Sort
View
MP
1998
109views more  MP 1998»
15 years 6 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
NGC
2002
Springer
103views Communications» more  NGC 2002»
15 years 6 months ago
An Evaluation of Topology-sensitive Subgroup Communication Mechanism in Large-scale Multicast Applications
Abundant content, data type and diverse members' interests naturally lead to preference heterogeneity within a multicast session requiring frequent communication within subgr...
Jangwon Lee, Gustavo de Veciana
TCAD
1998
95views more  TCAD 1998»
15 years 6 months ago
A framework for comparing models of computation
—We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general term...
Edward A. Lee, Alberto L. Sangiovanni-Vincentelli
SIGMETRICS
2002
ACM
107views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Passage time distributions in large Markov chains
Probability distributions of response times are important in the design and analysis of transaction processing systems and computercommunication systems. We present a general tech...
Peter G. Harrison, William J. Knottenbelt
SIMULATION
2002
142views more  SIMULATION 2002»
15 years 6 months ago
Agent-based Planning and Simulation of Combined Rail/Road Transport
A simulation model of the flow of Intermodal Terminal Units (ITUs) among inland intermodal terminals is presented. The intermodal terminals are inter-connected by rail corridors. ...
Luca Maria Gambardella, Andrea Emilio Rizzoli, Pet...
« Prev « First page 1433 / 1652 Last » Next »