The following pages link to Martin Middendorf (Q242846):
Displaying 50 items.
- Refined ranking relations for selection of solutions in multi objective metaheuristics (Q319120) (← links)
- Finding all sorting tandem duplication random loss operations (Q533407) (← links)
- Hyperreconfigurable architectures and the partition into hypercontexts problem (Q557645) (← links)
- Combined super-/substring and super-/subsequence problems (Q596093) (← links)
- Two-Dimensional partitioning problems (Q671423) (← links)
- On finding minimal, maximal, and consistent sequences over a binary alphabet (Q673107) (← links)
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- Self-organized task allocation for service tasks in computing systems with reconfigurable components (Q928690) (← links)
- Shortest common superstrings and scheduling with coordinated starting times (Q1127327) (← links)
- (Q1208725) (redirect page) (← links)
- The shortest common nonsubsequence problem is NP-complete (Q1208726) (← links)
- Scheduling inverse trees under the communication model of the LogP-machine (Q1285579) (← links)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
- Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
- Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
- More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- An algorithm for an Eulerian trail traversing specified edges in given order (Q1343142) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Optimum embedding of complete graphs in books (Q1379820) (← links)
- Improved heuristics and a genetic algorithm for finding short supersequences (Q1384223) (← links)
- Flows, view obstructions, and the lonely runner (Q1386416) (← links)
- Ant colony optimization with global pheromone evaluation for scheduling a single machine (Q1398081) (← links)
- On enforced convergence of ACO and its implementation on the reconfigurable mesh architecture using size reduction tasks (Q1431369) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes (Q1603521) (← links)
- A mathematical model of foraging in a dynamic environment by trail-laying Argentine ants (Q1784803) (← links)
- The minimum spanning tree problem on a planar graph (Q1805468) (← links)
- Multi colony ant algorithms (Q1850987) (← links)
- An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer. (Q1867336) (← links)
- Coloring interval graphs with First-Fit (Q1898342) (← links)
- Gossiping with multiple sends and receives (Q1917243) (← links)
- Transversal graphs for partially ordered sets: Sequencing, merging and scheduling problems (Q1970336) (← links)
- On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine (Q2158014) (← links)
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
- An empirically based simulation of group foraging in the harvesting ant, \textit{Messor pergandei} (Q2632362) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- (Q2770504) (← links)
- (Q2771658) (← links)
- Honeybee Optimisation – An Overview and a New Bee Inspired Optimisation Scheme (Q3081018) (← links)
- ADAPTING TO DYNAMIC ENVIRONMENTS: POLYETHISM IN RESPONSE THRESHOLD MODELS FOR SOCIAL INSECTS (Q3391937) (← links)
- Parallel Ant Colony Algorithms (Q3424828) (← links)
- A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO (Q3511950) (← links)
- Creating melodies and baroque harmonies with ant colony optimization (Q3526265) (← links)
- Artificial Bee Colony Optimization: A New Selection Scheme and Its Performance (Q3578840) (← links)
- Finding All Sorting Tandem Duplication Random Loss Operations (Q3637121) (← links)
