Sciweavers

275 search results - page 43 / 55
» Using Randomized Caches in Probabilistic Real-Time Systems
Sort
View
ICRA
2003
IEEE
160views Robotics» more  ICRA 2003»
14 years 27 days ago
Adapting navigation strategies using motions patterns of people
— As people move through their environments, they do not move randomly. Instead, they are often engaged in typical motion patterns, related to specific locations they might be i...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
AAAI
2007
13 years 10 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
IANDC
2010
116views more  IANDC 2010»
13 years 6 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
WIMOB
2007
IEEE
14 years 1 months ago
Performance Analysis of Ranging Process in IEEE 802.16e OFDMA Systems
In this paper, ranging process in IEEE 802.16e OFDMA systems is analyzed and performance is evaluated. Ranging process provides initial network entry, uplink synchronization, and ...
Doo Hwan Lee, Hiroyuki Morikawa
ALMOB
2006
155views more  ALMOB 2006»
13 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...