Sciweavers

205 search results - page 4 / 41
» Independent Additive Heuristics Reduce Search Multiplicative...
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
EOR
2002
84views more  EOR 2002»
13 years 7 months ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
SPIN
2004
Springer
14 years 23 days ago
Directed Error Detection in C++ with the Assembly-Level Model Checker StEAM
Most approaches for model checking software are based on ration of abstract models from source code, which may greatly reduce the search space, but may also introduce errors that a...
Peter Leven, Tilman Mehler, Stefan Edelkamp
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
4OR
2008
79views more  4OR 2008»
13 years 7 months ago
MIP-based heuristic for non-standard 3D-packing problems
This paper is the continuation of a previous work (Fasano 2004), dedicated to a MIP formulation for non-standard three-dimensional packing issues, with additional conditions. The ...
Giorgio Fasano