14518 search results - page 278 / 2904 » Two Problems for Sophistication |
169
click to vote
AAAI
1996
15 years 8 months ago
1996
Previous work suggests that reminding a conversational partner of mutually known information depends on the conversants' attentional state, their resource limits and the reso...
145
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
167
click to vote
ANOR
2008
15 years 6 months ago
2008
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
173
click to vote
DAM
2007
15 years 6 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
163
click to vote
MP
2010
15 years 5 months ago
2010
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...