3731 search results - page 98 / 747 » cases 2006 |
146
click to vote
INFORMATICALT
2000
15 years 5 months ago
2000
This work is an attempt of generalization of the simple statement about the requirements of commutation of words for the case of languages. In the paper, the necessary condition fo...
104
Voted
COMBINATORICS
1998
15 years 5 months ago
1998
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonne...
154
click to vote
JCO
2002
15 years 5 months ago
2002
The single machine scheduling problem with sum of completion times criterion (SS) can be solved easily by the Shortest Processing Time (SPT) rule. In the case of significant uncert...
122
click to vote
ORL
2010
15 years 4 months ago
2010
Interval-gradient cuts are (nonlinear) valid inequalities for nonconvex NLPs defined for constraints g(x) ≤ 0 with g being continuously differentiable in a box [x, ¯x]. In th...
113
click to vote
JCP
2006
15 years 5 months ago
2006
Our study proposes mutual aid platforms for the resolution of uncommon or non-conforming cases in both administrative and commercial procedures. On reviewing inter-customer interac...