211 search results - page 42 / 43 » Solving Games Without Determinization |
CSL
2010
Springer
13 years 5 months ago
2010
Springer
We present a system for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a priori. The sources are mo...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
SIGMETRICS
2008
ACM
13 years 5 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
IJON
2002
13 years 5 months ago
2002
In this paper I will show how reactive agents can solve relatively complex tasks without requiring any internal state and I will demonstrate that this is due to their ability to c...
SCHEDULING
2008
13 years 5 months ago
2008
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...