Sciweavers

1162 search results - page 81 / 233
» An Information-Based Theory of Conditionals
Sort
View
MP
2006
88views more  MP 2006»
14 years 11 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
IJNSEC
2007
127views more  IJNSEC 2007»
14 years 11 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
IWC
2007
105views more  IWC 2007»
14 years 11 months ago
Are interface agents scapegoats? Attributions of responsibility in human-agent interaction
This paper presents an investigation of the self-serving biases of interface agent users. An experiment that involved 202 MS Office users demonstrated that, in contrast to the sel...
Alexander Serenko
MOC
2000
85views more  MOC 2000»
14 years 11 months ago
Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
Liqun Qi, Defeng Sun
TON
2012
13 years 2 months ago
A Game-Theoretic Approach to Anonymous Networking
—Anonymous wireless networking is studied when an adversary monitors the transmission timing of an unknown subset of the network nodes. For a desired quality of service (QoS), as...
Parvathinathan Venkitasubramaniam, Lang Tong