Sciweavers

4037 search results - page 59 / 808
» Routing without ordering
Sort
View
JCST
2008
119views more  JCST 2008»
13 years 9 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
SP
2010
IEEE
152views Security Privacy» more  SP 2010»
13 years 6 months ago
Scalable Parametric Verification of Secure Systems: How to Verify Reference Monitors without Worrying about Data Structure Size
The security of systems such as operating systems, hypervisors, and web browsers depend critically on reference monitors to correctly enforce their desired security policy in the ...
Jason Franklin, Sagar Chaki, Anupam Datta, Arvind ...
VTC
2006
IEEE
106views Communications» more  VTC 2006»
14 years 3 months ago
A Distributed Routing Approach for Vehicle Routing in Logistic Networks
Abstract— The increasing complexity and dynamics of logistic processes is creating significant new challenges for the management of goods transport. This is leading to increased...
Bernd-Ludwig Wenning, Andreas Timm-Giel, Dirk Pesc...
ICC
2008
IEEE
14 years 3 months ago
Multiple-Hop Routing in Ultrafast All-Optical Packet Switching Network Using Multiple PPM Routing Tables
—In this paper we present the modeling and simulation of multiple-hop routing in ultrafast all-optical packet switching based routers employing multiple pulse position modulation...
Ming-Feng Chiang, Fary Ghassemlooy, Wai Pang Ng, H...
VTS
1996
IEEE
111views Hardware» more  VTS 1996»
14 years 1 months ago
Synthesis-for-scan and scan chain ordering
Designing a testable circuit is often a two step process. First, the circuit is designed to conform to the functional specifications. Then, the testability aspects are added. By t...
Robert B. Norwood, Edward J. McCluskey