Sciweavers

1019 search results - page 156 / 204
» Uniform Functors on Sets
Sort
View
IJAR
2007
55views more  IJAR 2007»
13 years 7 months ago
Theoretical analysis and practical insights on importance sampling in Bayesian networks
The AIS-BN algorithm [2] is a successful importance sampling-based algorithm for Bayesian networks that relies on two heuristic methods to obtain an initial importance function: -...
Changhe Yuan, Marek J. Druzdzel
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
IJCSA
2007
213views more  IJCSA 2007»
13 years 7 months ago
Adaptive Depth Control for Autonomous Underwater Vehicles Based on Feedforward Neural Networks
This paper studies the design and application of the neural network based adaptive control scheme for autonomous underwater vehicle's (AUV's) depth control system that i...
Yang Shi, Weiqi Qian, Weisheng Yan, Jun Li
ADHOC
2005
100views more  ADHOC 2005»
13 years 7 months ago
Robust position-based routing for wireless ad hoc networks
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
Kousha Moaveninejad, Wen-Zhan Song, Xiang-Yang Li
JACM
2007
115views more  JACM 2007»
13 years 7 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...