466 search results - page 65 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
173
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Spatial database operations are typically performed in two steps. In the filtering step, indexes and the minimum bounding rectangles (MBRs) of the objects are used to quickly dete...
157
click to vote
GECCO
2009
Springer
16 years 18 days ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
175
click to vote
TCOM
2008
15 years 6 months ago
2008
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
147
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
166
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...