نتایج جستجو برای: local branching algorithm

تعداد نتایج: 1252980  

2001
Tapio Elomaa Matti Kääriäinen

Branching programs are a generalization of decision trees. From the viewpoint of boosting theory the former appear to be exponentially more eecient. However, earlier experience demonstrates that such results do not necessarily translate to practical success. In this paper we develop a practical version of Mansour and McAllester's 13] algorithm for branching program boosting. We test the algorit...

This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

Content-based image retrieval (CBIR) has been an active research topic in the last decade. In this paper we proposed an image retrieval method using global and local features. Firstly, for local features extraction, SURF algorithm produces a set of interest points for each image and a set of 64-dimensional descriptors for each interest points and then to use Bag of Visual Words model, a cluster...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2006
Carolynne Montijn Ute Ebert Willem Hundsdorfer

Discharge streamers in experiments branch frequently. Arrayás [Phys. Rev. Lett. 88, 174502 (2002)] presented simulations of branching streamers and interpreted them as physical branching events. The numerical results were criticized by Kulikovsky [Phys. Rev. Lett. 89, 229401 (2002)]. Using an adaptive grid algorithm, we here present numerical experiments on the effect of grid resolution on stre...

Journal: :Oper. Res. Lett. 2005
Tobias Achterberg Thorsten Koch Alexander Martin

Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s state-of-the-art strong branching and pseudocost branching branching strategies for linear programming based branch-and...

2008
E. Katzav M. Adda - Bedia R. Arias

The problem of dynamic symmetric branching of a tensile crack propagating in a brittle material is studied within Linear Elastic Fracture Mechanics theory. The Griffith energy criterion and the principle of local symmetry provide necessary conditions for the onset of dynamic branching instability and for the subsequent paths of the branches. The theory predicts a critical velocity for branching...

Mashhadi Mohammad Reza , N., Omranpour, H.,

One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید