2880 search results - page 347 / 576 » Approximate Range Searching |
195
Voted
VLDB
2008
ACM
16 years 3 months ago
2008
ACM
This paper studies aggregate search in transaction time databases. Specifically, each object in such a database can be modeled as a horizontal segment, whose y-projection is its s...
143
Voted
ESOP
2010
Springer
16 years 23 days ago
2010
Springer
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
122
click to vote
EMO
2009
Springer
15 years 10 months ago
2009
Springer
A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of obje...
116
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Hyper-heuristics (HHs) are heuristics that work with an arbitrary set of search operators or algorithms and combine these algorithms adaptively to achieve a better performance tha...
131
Voted
ACSC
2008
IEEE
15 years 10 months ago
2008
IEEE
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...