-
Synergistic Team Composition: A Computational Approach to Foster Diversity in Teams
Co-operative learning in heterogeneous teams refers to learning methods ...
09/26/2019 ∙ by Ewa Andrejczuk, et al. ∙
15
∙
share
read it
-
Generic CP-Supported CMSA for Binary Integer Linear Programs
Construct, Merge, Solve and Adapt (CMSA) is a general hybrid metaheurist...
05/30/2018 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
A Hybrid Evolutionary Algorithm Based on Solution Merging for the Longest Arc-Preserving Common Subsequence Problem
The longest arc-preserving common subsequence problem is an NP-hard comb...
02/01/2017 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
Active exploration of sensor networks from a robotics perspective
Traditional algorithms for robots who need to integrate into a wireless ...
11/17/2015 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
Gradient-based Taxis Algorithms for Network Robotics
Finding the physical location of a specific network node is a prototypic...
09/26/2014 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
Mathematical Programming Strategies for Solving the Minimum Common String Partition Problem
The minimum common string partition problem is an NP-hard combinatorial ...
05/22/2014 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
On Solving the Oriented Two-Dimensional Bin Packing Problem under Free Guillotine Cutting: Exploiting the Power of Probabilistic Solution Construction
Two-dimensional bin packing problems are highly relevant combinatorial o...
09/05/2012 ∙ by Christian Blum, et al. ∙
0
∙
share
read it
-
Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs
Graph coloring, also known as vertex coloring, considers the problem of ...
11/24/2010 ∙ by Hugo Hernández, et al. ∙
0
∙
share
read it
-
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib
In this work we present a protocol for self-synchronized duty-cycling in...
10/21/2010 ∙ by Hugo Hernández, et al. ∙
0
∙
share
read it
