1529 search results - page 151 / 306 » Search Space Analysis of the Linear Ordering Problem |
131
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
－ It is a hotly research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. BFL algorithm is the most effective Counterexample minim...
142
click to vote
WWW
2009
ACM
16 years 5 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
135
click to vote
CIVR
2003
Springer
15 years 9 months ago
2003
Springer
We present an algorithm for video retrieval that fuses the decisions of multiple retrieval agents in both text and image modalities. While the normalization and combination of evi...
135
click to vote
UAI
2003
15 years 5 months ago
2003
The paper explores the power of two systematic Branch and Bound search algorithms that exploit partition-based heuristics, BBBT (a new algorithm for which the heuristic informatio...
123
click to vote
AIPS
2000
15 years 5 months ago
2000
Themostefficient planning algorithms recently developed are mainly based on Graphplansystem or on satisfiability approach. In this paper wepresent a new approach to plan generatio...