5606 search results - page 579 / 1122 » Randomization Techniques for Graphs. |
211
click to vote
ICITA
2005
IEEE
16 years 23 days ago
2005
IEEE
A re-ranking technique,called “PageRank brings a successful story behind the search engine. Many studies focus on finding an way to compute the PageRank scores of a large web gr...
209
click to vote
ESA
2004
Springer
16 years 16 days ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
220
click to vote
AAAI
2008
15 years 9 months ago
2008
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
202
click to vote
FLAIRS
2008
15 years 9 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
213
click to vote
AIPS
2006
15 years 8 months ago
2006
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...