نتایج جستجو برای Tabu search

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

1995
Markus Stricker,

Many computer vision problems, such as gure-ground segmentation, simultaneous tting of curves, selection of an optimal set of geometric primitives, can be formulated naturally as discrete optimization problems. The statement of these problems is relatively easy, but to nd techniques that eeciently solve them constitutes a major challenge. In this paper we focus on gure-ground segmentation. We p...

2004
Deacha Puangdownreong, Sarawut Sujitjorn, Thanatchai Kulworawanichpong,

This paper presents a convergence proof of the adaptive tabu search (ATS) algorithms. The proof consists of two parts, i.e. convergence proof of all interested solutions in a finite search space, and that of searching processes of the ATS algorithms to the global minimum. With the proposed definitions and theorems, the proofs show that the ATS algorithms based on a random process have finite co...

Journal: :Parallel Computing 1998
El-Ghazali Talbi, Z. Hafidi, Jean-Marc Geib,

This paper presents a new approach for parallel tabu search based on adaptive parallelism. Adaptive parallelism was used to dynamically adjust the parallelism degree of the application with respect to the system load. Adaptive parallelism demonstrates that high-performance computing using a hundred of heterogeneous workstations combined with massively parallel machines is feasible to solve larg...

Journal: :Comput. Syst. Sci. Eng. 2006
Maria J. Blesa, Jordi Petit, Fatos Xhafa,

Tabu Search (TS) is a meta-heuristic for solving combinatorial optimization problems. A review of existing implementations for TS reveals that, on the one hand, these implementations are ad hoc and, on the other hand, most of them run in a sequential setting. Indeed, the reported parallel implementations are few as compared to the sequential implementations. Due to increase in computing resourc...

Journal: :International journal of neural systems 2008
Gilles Lebrun, Christophe Charrier, Olivier Lézoray, Hubert Cardot,

A model selection method based on tabu search is proposed to build support vector machines (binary decision functions) of reduced complexity and efficient generalization. The aim is to build a fast and efficient support vector machines classifier. A criterion is defined to evaluate the decision function quality which blends recognition rate and the complexity of a binary decision functions toge...

Journal: :JSEA 2010
Anu Sharma, Arpita Jadhav, Praveen Ranjan Srivastava, Renu Goyal,

In order to deliver a complete reliable software product, testing is performed. As testing phase carries on, cost of testing process increases and it directly affects the overall project cost. Many a times it happens that the actual cost becomes more than the estimated cost. Cost is considered as the most important parameter with respect to software testing, in software industry. In recent year...

2007
Nysret Musliu,

Many important real world problems can be formulated as Constraint Satisfaction Problems (CSPs). A CSP consists of a set of variables each with a domain of possible values, and a set of constraints on the allowed values for specified subsets of variables. A solution to CSP is the assignment of values to variables, such that no constraint is violated. CSPs include many NP-complete problems and a...

1998
Qifa Ke, Gang Xu, Songde Ma,

We propose a new approach to recover epipolar geometry from a pair of uncalibrated images. By minimizing a proposed cost function, our approach matches the detected feature points from an image pair, discards the outliers and recovers the epipolar geometry simutaneously. Experiments on real images show that this approach is effective and fast.

2005
ABRAHAM DUARTE, RAFAEL MARTÍ,

In this paper, we develop new heuristic procedures for the maximum diversity problem (MDP). This NPhard problem has a significant number of practical applications such as environmental balance, telecommunication services or genetic engineering. The proposed algorithm is based on the tabu search methodology and incorporates memory structures for both construction and improvement. Although propos...

2002
M. A. ABIDO,

This paper presents an e cient and reliable tabu search (TS)–based approach to solve the optimal power ow (OPF) problem. The proposed approach employs TS algorithm for optimal settings of the control variables of the OPF problem. Incorporation of TS as a derivative-free optimization technique in solving OPF problem signiŽcantly reduces the computational burden. One of the main advantages of T...

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

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