3663 search results - page 207 / 733 » Problems in the ontology of computer programs |
186
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
231
click to vote
ICALP
2005
Springer
16 years 3 days ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
187
click to vote
AICCSA
2007
IEEE
16 years 28 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
163
click to vote
ENC
2005
IEEE
16 years 6 days ago
2005
IEEE
We developed generators that produce challenging MKP instances. Our approaches uses independently exponential distributions over a wide range to generate the constraint coefficien...
187
click to vote
HPCN
1997
Springer
15 years 10 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...