1933 search results - page 229 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
147
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
125
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We consider the problem of scheduling dynamically arriving jobs in a non-clairvoyant setting, that is, when the size of a job in remains unknown until the job finishes execution. ...
122
Voted
SPAA
2010
ACM
15 years 8 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
139
click to vote
AAAI
2006
15 years 5 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
155
Voted
ICDM
2010
IEEE
15 years 2 months ago
2010
IEEE
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...