Sciweavers

13987 search results - page 247 / 2798
» The Two Guards Problem
Sort
View
ESA
2010
Springer
163views Algorithms» more  ESA 2010»
15 years 5 months ago
On the Huffman and Alphabetic Tree Problem with General Cost Functions
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...
Hiroshi Fujiwara, Tobias Jacobs
ANOR
2008
66views more  ANOR 2008»
15 years 4 months ago
Optimization problems involving collections of dependent objects
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...
David L. Roberts, Charles L. Isbell, Michael L. Li...
138
Voted
DAM
2007
70views more  DAM 2007»
15 years 4 months ago
Tree-edges deletion problems with bounded diameter obstruction sets
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...
Dekel Tsur
MP
2010
103views more  MP 2010»
15 years 2 months ago
Relations between facets of low- and high-dimensional group problems
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...
Santanu S. Dey, Jean-Philippe P. Richard
FLAIRS
2009
15 years 2 months ago
Automatic Text Categorization of Mathematical Word Problems
This paper describes a novel application of text categorization for mathematical word problems, namely Multiplicative Compare and Equal Group problems. The empirical results and a...
Suleyman Cetintas, Luo Si, Yan Ping Xin, Dake Zhan...