Sciweavers

1124 search results - page 37 / 225
» Generalized Conditioning in Neighbourhood Models
Sort
View
PEWASUN
2004
ACM
14 years 1 months ago
An M/MMGI/1/K queuing model for IEEE 802.11 ad hoc networks
An M/MMGI/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, ...
Mustafa Özdemir, A. Bruce McDonald
IJNSEC
2007
127views more  IJNSEC 2007»
13 years 7 months ago
Markov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the Probabilistic Packet Marking (PPM) algorithm is not correct for general networks, and this implies the estimati...
Tsz-Yeung Wong, John Chi-Shing Lui, Man Hon Wong
NAACL
2010
13 years 5 months ago
Softmax-Margin CRFs: Training Log-Linear Models with Cost Functions
We describe a method of incorporating taskspecific cost functions into standard conditional log-likelihood (CLL) training of linear structured prediction models. Recently introduc...
Kevin Gimpel, Noah A. Smith
AAAI
1996
13 years 9 months ago
Incorporating Opponent Models into Adversary Search
This work presents a generalized theoretical framework that allows incorporation of opponent models into adversary search. We present the M algorithm, a generalization of minimax ...
David Carmel, Shaul Markovitch
JSAC
2006
88views more  JSAC 2006»
13 years 7 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel