94 search results - page 7 / 19 » On Probabilistic Time versus Alternating Time |
COLT
1995
Springer
14 years 16 days 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...
CVPR
2007
IEEE
14 years 11 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...
ICRA
2007
IEEE
14 years 3 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...
IPL
2008
13 years 9 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...
ACSD
2008
IEEE
13 years 11 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...