1914 search results - page 194 / 383 » Evaluation of a Catalytic Search Algorithm |
140
click to vote
ISPDC
2008
IEEE
15 years 10 months ago
2008
IEEE
We consider the problem of computing all Nash equilibria in bimatrix games (i.e., nonzero-sum two-player noncooperative games). Computing all Nash equilibria for large bimatrix ga...
119
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
In high-level synthesis, accurate lower-bound estimation is helpful to explore the search space efficiently and to evaluate the quality of heuristic algorithms. For the lower-bound...
133
click to vote
SIGIR
2004
ACM
15 years 9 months ago
2004
ACM
We discuss a retrieval model in which the task is to complete a sentence, given an initial fragment, and given an application specific document collection. This model is motivate...
127
click to vote
ASUNAM
2010
IEEE
15 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
142
click to vote
AAAI
2011
14 years 4 months ago
2011
Previous research in Artificial Intelligence has identified the possibility of simplifying planning problems via the identification and exploitation of symmetries. We advance t...