994 search results - page 97 / 199 » Custom Computing Machines for the Set Covering Problem |
147
click to vote
COLING
2010
14 years 10 months ago
2010
We study a novel shallow information extraction problem that involves extracting sentences of a given set of topic categories from medical forum data. Given a corpus of medical fo...
109
click to vote
CSR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
141
click to vote
TCS
2010
15 years 1 months ago
2010
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
115
click to vote
TC
1998
15 years 2 months ago
1998
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
124
Voted
EVOW
2005
Springer
15 years 8 months ago
2005
Springer
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...