Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,048
Array Pattern Nulling by Phase and Position Perturbations with the Use of a Modified Tabu Search Algorithm
"... A useful and flexible method based on the tabu search algorithm for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling both the phase and the position of each array element. To show the versatility of the present m ..."
Abstract
- Add to MetaCart
A useful and flexible method based on the tabu search algorithm for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling both the phase and the position of each array element. To show the versatility of the present
NULL STEERING OF LINEAR ANTENNA ARRAYS USING A MODIFIED TABU SEARCH ALGORITHM
"... Abstract—A useful and flexible method based on the tabu search algorithm for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling the amplitude-only and both the amplitude and phase of each array element. To show the ..."
Abstract
- Add to MetaCart
Abstract—A useful and flexible method based on the tabu search algorithm for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling the amplitude-only and both the amplitude and phase of each array element. To show
An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
"... chi ve of S ID ..."
TABU SEARCH
"... Tabu Search is a metaheuristic that guides a local heuristic search procedure to explore the solution space beyond local optimality. One of the main components of tabu search is its use of adaptive memory, which creates a more flexible search behavior. Memory based strategies are therefore the hallm ..."
Abstract
-
Cited by 822 (48 self)
- Add to MetaCart
algorithms based on the tabu search. The experimentation shows that the procedures provide high quality solutions to the training problem, and in addition consume a reasonable computational effort.
A learning algorithm for Boltzmann machines
- Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract
-
Cited by 584 (13 self)
- Add to MetaCart
to a gen-eral learning rule for modifying the connection strengths so as to incorporate knowledge obout o task domain in on efficient way. We describe some simple examples in which the learning algorithm creates internal representations thot ore demonstrobly the most efficient way of using
Fast texture synthesis using tree-structured vector quantization
, 2000
"... Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given ..."
Abstract
-
Cited by 561 (12 self)
- Add to MetaCart
Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given
Articulated body motion capture by annealed particle filtering
- In IEEE Conf. on Computer Vision and Pattern Recognition
, 2000
"... The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach is to intr ..."
Abstract
-
Cited by 494 (4 self)
- Add to MetaCart
The main challenge in articulated body motion tracking is the large number of degrees of freedom (around 30) to be recovered. Search algorithms, either deterministic or stochastic, that search such a space without constraint, fall foul of exponential computational complexity. One approach
FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO Artificial Intelligence
, 1986
"... Scope and Purpose-A summary is provided of some of the recent (and a few not-so-recent) developments that otTer promise for enhancing our ability to solve combinatorial optimization problems. These developments may be usefully viewed as a synthesis of the perspectives of operations research and arti ..."
Abstract
-
Cited by 379 (8 self)
- Add to MetaCart
and operations research. To demonstrate this, four key areas are examined: (1) controlled randomization, (2) learning strategies, (3) induced decomposition and (4) tabu search. Each of these is shown to have characteristics that appear usefully relevant to developments on the horizon.
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
- IEEE Transactions on Knowledge and Data Engineering
, 1998
"... In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various applica ..."
Abstract
-
Cited by 326 (27 self)
- Add to MetaCart
of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental
Tabu Search heuristics for the vehicle routing problem
, 2002
"... This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighborhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by ..."
Abstract
-
Cited by 114 (11 self)
- Add to MetaCart
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighborhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed
Results 1 - 10
of
3,048
