Sciweavers

522 search results - page 21 / 105
» Necessary but Not Sufficient
Sort
View
JAMDS
2000
61views more  JAMDS 2000»
13 years 7 months ago
A coupling technique for stochastic comparison of functions of Markov Processes
The aim of this work is to obtain explicit conditions (i.e., conditions on the transition rates) for the stochastic comparison of Markov Processes. A general coupling technique is ...
M. Doisy
IJISEC
2002
58views more  IJISEC 2002»
13 years 7 months ago
A complete characterization of a family of key exchange protocols
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is informationtheoretically secure from t...
Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki
SIAMCO
2002
89views more  SIAMCO 2002»
13 years 7 months ago
Convexity in Zero-Sum Differential Games
A new approach to two-player zero-sum differential games with convex-concave cost function is presented. It employs the tools of convex and variational analysis. A necessary and s...
Rafal Goebel
COCOA
2010
Springer
13 years 5 months ago
Coverage with k-Transmitters in the Presence of Obstacles
Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
Brad Ballinger, Nadia Benbernou, Prosenjit Bose, M...
ENDM
2010
112views more  ENDM 2010»
13 years 5 months ago
On the complexity of the Eulerian closed walk with precedence path constraints problem
The Eulerian closed walk problem in a digraph is a well-known polynomial-time solvable problem. In this paper, we show that if we impose the feasible solutions to fulfill some pre...
Hervé Kerivin, Mathieu Lacroix, Ali Ridha M...