Sciweavers

2343 search results - page 85 / 469
» Visual-Concept Search Solved
Sort
View
AAAI
2008
15 years 6 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
AAAI
2010
15 years 5 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 5 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
156
Voted
WSC
1998
15 years 5 months ago
Reactive Tabu Search in Unmanned Aerial Reconnaissance Simulations
We apply a Reactive Tabu Search (RTS) heuristic within a discrete-event simulation to solve routing problems for Unmanned Aerial Vehicles (UAVs). Our formulation represents this p...
Joel L. Ryan, T. Glenn Bailey, James T. Moore, Wil...
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
15 years 5 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn