16404 search results - page 648 / 3281 » A set coverage problem |
208
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
172
click to vote
JSAI
2005
Springer
16 years 20 days ago
2005
Springer
: In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that t...
199
click to vote
ANOR
2006
15 years 7 months ago
2006
This paper presents two contributions: A set of routines that manipulate instances of stochastic programming problems in order to make them more amenable for different solution ap...
146
click to vote
JCT
2006
15 years 7 months ago
2006
In [8] we posed a series of extremal (set system) problems under dimension constraints. In the present paper we study one of them: the intersection problem. The geometrical formul...
198
click to vote
NETWORKS
2006
15 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...