16404 search results - page 824 / 3281 » A set coverage problem |
166
click to vote
AI
2007
Springer
15 years 7 months ago
2007
Springer
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
169
click to vote
AUTOMATICA
2006
15 years 7 months ago
2006
In this paper we solve the general problem of designing a feedback controller to reach a set of facets of an n-dimensional simplex in finite time, for a system evolving with linea...
189
click to vote
IANDC
2008
15 years 7 months ago
2008
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
187
click to vote
IPL
2006
15 years 7 months ago
2006
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
184
click to vote
JSAT
2008
15 years 7 months ago
2008
In this technical report we briefly describe the instances submitted to the 2006 and 2007 MaxSAT Evaluations. First, we introduce the instances that can be directly encoded as Max...