13376 search results - page 339 / 2676 » Problem Solving with |
153
click to vote
COCOON
2010
Springer
15 years 8 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
131
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
149
click to vote
ATMOS
2010
15 years 3 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
118
click to vote
COR
2006
15 years 4 months ago
2006
Home health care, i.e. visiting and nursing patients in their homes, is a growing sector in the medical service business. From a staff rostering point of view, the problem is to f...
166
click to vote
JDA
2007
15 years 4 months ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...