Sciweavers

3055 search results - page 253 / 611
» Randomized Search Trees
Sort
View
ECAI
2008
Springer
15 years 5 months ago
Justification-Based Non-Clausal Local Search for SAT
While stochastic local search (SLS) techniques are very efficient in solving hard randomly generated propositional satisfiability (SAT) problem instances, a major challenge is to i...
Matti Järvisalo, Tommi A. Junttila, Ilkka Nie...
DICTA
2003
15 years 4 months ago
Synthesising Textures Using Variable Neighbourhood Searching
Abstract. Texture synthesis aims to define and reproduce discriminating image features. These features are used to associate with and differentiate between two textures. Often tex...
Minh Tran, Amitava Datta
EOR
2008
200views more  EOR 2008»
15 years 3 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
DAC
2005
ACM
16 years 4 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
EPIA
2005
Springer
15 years 8 months ago
Adapting Peepholing to Regression Trees
This paper presents an adaptation of the peepholing method to regression trees. Peepholing was described as a means to overcome the major computational bottleneck of growing classi...
Luís Torgo, Joana Marques