Sciweavers

2194 search results - page 269 / 439
» Improving HLRTA*( k )
Sort
View
ECML
2007
Springer
15 years 7 months ago
Neighborhood-Based Local Sensitivity
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
Paul N. Bennett
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
15 years 7 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 7 months ago
Global multiobjective optimization via estimation of distribution algorithm with biased initialization and crossover
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...
SAS
2007
Springer
111views Formal Methods» more  SAS 2007»
15 years 7 months ago
Exploiting Pointer and Location Equivalence to Optimize Pointer Analysis
Abstract. Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. Ho...
Ben Hardekopf, Calvin Lin
STACS
2007
Springer
15 years 7 months ago
On Completing Latin Squares
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
Iman Hajirasouliha, Hossein Jowhari, Ravi Kumar, R...