1168 search results - page 103 / 234 » Optimization strategies for complex queries |
103
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We propose a new evolutionary approach to solve the 0/1 multiple knapsack problem. We approach the problem from a new viewpoint different from traditional methods. The most remar...
116
Voted
CORR
2007
Springer
15 years 21 days ago
2007
Springer
—This paper considers the design of efficient strategies that allow cognitive users to choose frequency bands to sense and access among multiple bands with unknown parameters. F...
95
Voted
COCO
2005
Springer
15 years 6 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
141
Voted
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
123
click to vote
VLDB
2007
ACM
15 years 6 months ago
2007
ACM
This paper describes Continuous Queries (CQ) in Oracle RDBMS, a feature that incorporates stream and complex event processing into an RDBMS, the first such attempt in commercial d...