Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,528
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
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
Does foreign direct investment increase the productivity of domestic firms? In search of spillovers through backward linkages
- AMERICAN ECONOMIC REVIEW
, 2003
"... Many countries strive to attract foreign direct investment (FDI) in the hope that knowledge brought by multinationals will spill over to domestic industries and increase their productivity. In contrast with earlier literature that failed to find positive intra-industry spillovers from FDI, this stu ..."
Abstract
-
Cited by 433 (11 self)
- Add to MetaCart
Many countries strive to attract foreign direct investment (FDI) in the hope that knowledge brought by multinationals will spill over to domestic industries and increase their productivity. In contrast with earlier literature that failed to find positive intra-industry spillovers from FDI
Spill Code Minimization via Interference Region Spilling
- in SIGPLAN Conference on Programming Language Design and Implementation
, 1997
"... Many optimizing compilers perform global register allocation using a Chaitin-style graph coloring algorithm. Live ranges that cannot be allocated to registers are spilled to memory. The amount of code required to spill the live range depends on the spilling heuristic used. Chaitin's spilling he ..."
Abstract
-
Cited by 41 (1 self)
- Add to MetaCart
heuristic offers some guidance in reducing the amount of spill code produced. However, this heuristic does not allow the partial spilling of live ranges and the reduction in spill code is limited to a local level. In this paper, we present a global technique called interference region spilling that improves
Internet traffic engineering by optimizing OSPF weights
- in Proc. IEEE INFOCOM
, 2000
"... Abstract—Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. Traffic flow is routed along shortest paths, splitting flow at nodes where several outgoing links are on shortest paths to the destination. The weights of the links, and thereby the shortest pa ..."
Abstract
-
Cited by 403 (13 self)
- Add to MetaCart
resorted to a local search heuristic. Surprisingly it turned out that for the proposed AT&T WorldNet backbone, we found weight settings that performed
Tabu Search -- Part II
, 1990
"... This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilis ..."
Abstract
-
Cited by 387 (5 self)
- Add to MetaCart
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a
Poisson Surface Reconstruction
, 2006
"... We show that surface reconstruction from oriented points can be cast as a spatial Poisson problem. This Poisson formulation considers all the points at once, without resorting to heuristic spatial partitioning or blending, and is therefore highly resilient to data noise. Unlike radial basis function ..."
Abstract
-
Cited by 369 (5 self)
- Add to MetaCart
We show that surface reconstruction from oriented points can be cast as a spatial Poisson problem. This Poisson formulation considers all the points at once, without resorting to heuristic spatial partitioning or blending, and is therefore highly resilient to data noise. Unlike radial basis
Variable Neighborhood Search
, 1997
"... Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications a ..."
Abstract
-
Cited by 355 (26 self)
- Add to MetaCart
Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications
The localization of knowledge and the mobility of engineers in regional networks
- Management Science
, 1999
"... Knowledge, once generated, spills only imperfectly among firms and nations. We positthat since institutions and labor networks vary by region, there should be regional variations in the localization of spillovers. We investigate the relationship between the mobility of major patent holders and the l ..."
Abstract
-
Cited by 295 (5 self)
- Add to MetaCart
Knowledge, once generated, spills only imperfectly among firms and nations. We positthat since institutions and labor networks vary by region, there should be regional variations in the localization of spillovers. We investigate the relationship between the mobility of major patent holders
On the Implementation of an Interior-Point Filter Line-Search Algorithm for Large-Scale Nonlinear Programming
, 2004
"... We present a primal-dual interior-point algorithm with a filter line-search method for non-linear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration ph ..."
Abstract
-
Cited by 294 (6 self)
- Add to MetaCart
We present a primal-dual interior-point algorithm with a filter line-search method for non-linear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration
Results 1 - 10
of
4,528
