435 search results - page 10 / 87 » Partitioning Search Spaces of a Randomized Search |
125
Voted
TSP
2010
14 years 10 months ago
2010
In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which...
135
Voted
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
125
Voted
SPIN
2004
Springer
15 years 9 months ago
2004
Springer
The Murϕ-based Hopper tool is a general purpose explicit model checker. Hopper leverages Murϕ’s class structure to implement new algorithms. Hopper differs from Murϕ in that i...
118
Voted
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
205
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...