1920 search results - page 29 / 384 » The Complexity of the A B C Problem |
146
click to vote
ORL
1998
15 years 5 months ago
1998
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
173
click to vote
VAMOS
2007
Springer
15 years 12 months ago
2007
Springer
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
167
click to vote
EJC
2002
15 years 5 months ago
2002
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
168
click to vote
GECCO
2007
Springer
16 years 4 hour ago
2007
Springer
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
168
click to vote
KI
2005
Springer
15 years 11 months ago
2005
Springer
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...