Sciweavers

677 search results - page 126 / 136
» Rigorous Object-Oriented Analysis
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
ASIACRYPT
2009
Springer
14 years 1 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
ICRA
2008
IEEE
167views Robotics» more  ICRA 2008»
14 years 1 months ago
An approximate algorithm for solving oracular POMDPs
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
Nicholas Armstrong-Crews, Manuela M. Veloso
INFOCOM
2008
IEEE
14 years 1 months ago
A Novel Quantitative Approach For Measuring Network Security
—Evaluation of network security is an essential step in securing any network. This evaluation can help security professionals in making optimal decisions about how to design secu...
Mohammad Salim Ahmed, Ehab Al-Shaer, Latifur Khan
SASO
2007
IEEE
14 years 1 months ago
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distrib...
Steven Y. Ko, Indranil Gupta, Yookyung Jo