Sciweavers

2006 search results - page 239 / 402
» Heuristic Security-Testing Methods
Sort
View
109
Voted
EOR
2002
105views more  EOR 2002»
15 years 28 days ago
Two-dimensional packing problems: A survey
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
Andrea Lodi, Silvano Martello, Michele Monaci
113
Voted
SIAMCO
2000
138views more  SIAMCO 2000»
15 years 27 days ago
Adaptive Image Reconstruction Using Information Measures
We present a class of nonlinear adaptive image restoration filters which may be steered to preserve sharp edges and contrasts in the restorations. From a theoretical point of view ...
Ulrike Hermann, Dominikus Noll
NC
2002
210views Neural Networks» more  NC 2002»
15 years 24 days ago
Recent approaches to global optimization problems through Particle Swarm Optimization
This paper presents an overview of our most recent results concerning the Particle Swarm Optimization (PSO) method. Techniques for the alleviation of local minima, and for detectin...
Konstantinos E. Parsopoulos, Michael N. Vrahatis
113
Voted
TCAD
2002
128views more  TCAD 2002»
15 years 23 days ago
Preferred direction Steiner trees
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
Mehmet Can Yildiz, Patrick H. Madden
104
Voted
ATMOS
2010
163views Optimization» more  ATMOS 2010»
15 years 3 days ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...