Sciweavers

107 search results - page 15 / 22
» Dynamic Management of Heuristics for Solving Structured CSPs
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
92
Voted
WAIM
2007
Springer
15 years 3 months ago
An Efficient Spatial Search Method Based on SG-Tree
To solve the overlapping search of multidimensional spatial database containing large quantity of objects with dynamic spatial extent, this paper proposes an index structure named ...
Yintian Liu, Changjie Tang, Lei Duan, Tao Zeng, Ch...
BCI
2009
IEEE
15 years 4 months ago
Database Oriented Grid Middlewares
—Efficient management of massive data sets is a key aspect in typical grid and e-science applications. To this end, the benefits of employing database technologies in such appl...
Efthymia Tsamoura, Anastasios Gounaris
ICCV
2003
IEEE
15 years 11 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
AUSAI
2007
Springer
15 years 1 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...