Sciweavers

6976 search results - page 237 / 1396
» The Oil Searching Problem
Sort
View
SETN
2004
Springer
15 years 12 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
AI
2003
Springer
15 years 12 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
ATAL
2008
Springer
15 years 8 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun
ECSCW
2007
15 years 8 months ago
Tag-Based Metonymic Search in an Activity-Centric Aggregation Service
Knowledge workers often need to find, organize, and work with heterogeneous resources from diverse services, information stores, and repositories. This paper analyzes two problems ...
Michael J. Muller, Werner Geyer, Beth Brownholtz, ...
CVPR
2012
IEEE
13 years 9 months ago
A fast nearest neighbor search algorithm by nonlinear embedding
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
Yoonho Hwang, Bohyung Han, Hee-Kap Ahn