Sciweavers

1763 search results - page 273 / 353
» A Formalization of Polytime Functions
Sort
View
PKC
2007
Springer
111views Cryptology» more  PKC 2007»
16 years 9 days ago
Optimistic Fair Exchange in a Multi-user Setting
: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-us...
Yevgeniy Dodis, Pil Joong Lee, Dae Hyun Yum
SAFECOMP
2007
Springer
16 years 9 days ago
Safety Analysis of Safety-Critical Software for Nuclear Digital Protection System
A strategy and relating activities of a software safety analysis (SSA) are presented for the software of a digital reactor protection system where software modules in the design de...
Gee-Yong Park, Jang-Soo Lee, Se Woo Cheon, Kee-Cho...
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
16 years 9 days ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
16 years 7 days ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
GLOBECOM
2006
IEEE
16 years 7 days ago
Maximizing Broadcast Tree Lifetime in Wireless Ad Hoc Networks
— In wireless ad hoc networks (WANETs), e.g. wireless sensor networks, battery-powered devices are constrained by limited amount of energy. Many WANET applications require that t...
Guofeng Deng, Sandeep K. S. Gupta