Sciweavers

1268 search results - page 140 / 254
» High Impact Requirements Engineering
Sort
View
HM
2010
Springer
146views Optimization» more  HM 2010»
15 years 1 months ago
An Improved Memetic Algorithm for Break Scheduling
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control a...
Magdalena Widl, Nysret Musliu
CEC
2007
IEEE
15 years 1 months ago
Entropy-based Memetic Particle Swarm Optimization for computing periodic orbits of nonlinear mappings
— The computation of periodic orbits of nonlinear mappings is very important for studying and better understanding the dynamics of complex systems. Evolutionary algorithms have s...
Y. G. Petalas, Konstantinos E. Parsopoulos, Michae...
119
Voted
CORR
2010
Springer
74views Education» more  CORR 2010»
15 years 1 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
IM
2008
15 years 1 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
MICRO
2006
IEEE
113views Hardware» more  MICRO 2006»
15 years 1 months ago
Exploiting Fine-Grained Data Parallelism with Chip Multiprocessors and Fast Barriers
We examine the ability of CMPs, due to their lower onchip communication latencies, to exploit data parallelism at inner-loop granularities similar to that commonly targeted by vec...
Jack Sampson, Rubén González, Jean-F...