7167 search results - page 750 / 1434 » Answer Set Programming |
175
click to vote
DAM
2008
15 years 7 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
187
click to vote
JCP
2006
15 years 7 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
196
click to vote
FGCS
2010
15 years 5 months ago
2010
Bulk Synchronous Parallel ML is a high-level language for programming parallel algorithms. Built upon OCaml and using the BSP model, it provides a safe setting for their implementa...
247
click to vote
MEDBIOMETRICS
2010
15 years 5 months ago
2010
This study proposes an effective method called DIAMOND to classify biological and medical data. Given a set of objects with some classes, DIAMOND separates the objects into differe...
199
click to vote
ICMLA
2009
15 years 4 months ago
2009
Abstract--Feature selection is an important challenge in machine learning. Unfortunately, most methods for automating feature selection are designed for supervised learning tasks a...