Sciweavers

1101 search results - page 71 / 221
» heuristics 2007
Sort
View
ICDE
2007
IEEE
124views Database» more  ICDE 2007»
14 years 11 months ago
On MBR Approximation of Histories for Historical Queries: Expectations and Limitations
Traditional approaches for efficiently processing historical queries, where a history is a multidimensional timeseries, employ a two step filter-and-refine scheme. In the filter s...
Reza Sherkat, Davood Rafiei
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 11 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICC
2007
IEEE
14 years 4 months ago
IPACT with Smallest Available Report First: A New DBA Algorithm for EPON
—Dynamic Bandwidth allocation in Ethernet Passive Optical Networks (EPONs) has been an area of intense research in recent years. Most of the proposed solutions offer clever metho...
Swapnil Bhatia, Radim Bartos
GECCO
2007
Springer
171views Optimization» more  GECCO 2007»
14 years 3 months ago
Toward a better understanding of rule initialisation and deletion
A number of heuristics have been used in Learning Classifier Systems to initialise parameters of new rules, to adjust fitness of parent rules when they generate offspring, and ...
Tim Kovacs, Larry Bull
FLAIRS
2007
13 years 12 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace