16404 search results - page 860 / 3281 » A set coverage problem |
180
click to vote
DAM
2008
15 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
219
click to vote
JAIR
2008
15 years 7 months ago
2008
In this paper, we propose a set of tasks that are relevant for the modular reuse of ontologies. In order to formalize these tasks as reasoning problems, we introduce the notions o...
197
click to vote
DAM
2007
15 years 7 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
255
click to vote
INFORMATICALT
2007
15 years 7 months ago
2007
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verificatio...
196
click to vote
TCBB
2008
15 years 7 months ago
2008
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...