Sciweavers

39 search results - page 6 / 8
» A New Look at Selfish Routing
Sort
View
WIMOB
2008
IEEE
14 years 1 months ago
Exploiting Self-Reported Social Networks for Routing in Ubiquitous Computing Environments
— Mobile, delay-tolerant, ad hoc and pocket-switched networks may form an important part of future ubiquitous computing environments. Understanding how to efficiently and effect...
Greg Bigwood, D. Rehunathan, Martin Bateman, Trist...
FPGA
2000
ACM
161views FPGA» more  FPGA 2000»
13 years 11 months ago
The effect of LUT and cluster size on deep-submicron FPGA performance and density
In this paper we revisit the FPGA architectural issue of the effect of logic block functionality on FPGA performance and density. In particular, in the context of lookup table, cl...
Elias Ahmed, Jonathan Rose
CSREASAM
2006
13 years 8 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
INFOCOM
2010
IEEE
13 years 5 months ago
Max-Contribution: On Optimal Resource Allocation in Delay Tolerant Networks
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
Kyunghan Lee, Yung Yi, Jaeseong Jeong, Hyungsuk Wo...
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
14 years 21 days ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu