Sciweavers

1650 search results - page 232 / 330
» The HOM problem is decidable
Sort
View
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
16 years 27 days ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
ICALP
2010
Springer
15 years 11 months ago
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
Amir Shpilka, Ilya Volkovich
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
15 years 10 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan
AAAI
2007
15 years 8 months ago
Concurrent Action Execution with Shared Fluents
Concurrent action execution is important for plan-length minimization. However, action specifications are often limited to avoid conflicts arising from precondition/effect inter...
Michael Buro, Alexander Kovarsky
COR
2002
95views more  COR 2002»
15 years 6 months ago
Dynamic lot sizing and tool management in automated manufacturing systems
The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolat...
M. Selim Akturk, Siraceddin Onen