92 search results - page 6 / 19 » Making the Breakout Algorithm Complete Using Systematic Sear... |
101
click to vote
HIPC
2009
Springer
14 years 7 months ago
2009
Springer
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
SISAP
2008
IEEE
15 years 3 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
WFLP
2009
Springer
15 years 2 months ago
2009
Springer
Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an ex...
AIPS
2010
14 years 9 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...