841 search results - page 62 / 169 » Approximability of Minimum AND-Circuits |
138
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Q-learning is a technique used to compute an optimal policy for a controlled Markov chain based on observations of the system controlled using a non-optimal policy. It ...
141
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
IAT
2008
IEEE
15 years 10 months ago
2008
IEEE
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
109
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
126
click to vote
LATIN
2010
Springer
15 years 11 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...