94 search results - page 7 / 19 » On Probabilistic Time versus Alternating Time |
142
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
146
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper, we present a learning procedure called probabilistic boosting network (PBN) for joint real-time object detection and pose estimation. Grounded on the law of total p...
116
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
131
click to vote
IPL
2008
15 years 4 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
139
click to vote
ACSD
2008
IEEE
15 years 6 months ago
2008
IEEE
We present a process algebra with conditionally distributed discrete-time delays and generally-distributed stochastic delays. The treatment allows for expansion laws for the paral...