8647 search results - page 412 / 1730 » The Container Selection Problem |
124
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
107
click to vote
DM
2008
15 years 4 months ago
2008
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P...
117
click to vote
IPL
2006
15 years 4 months ago
2006
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
161
click to vote
EOR
2010
15 years 2 months ago
2010
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
140
Voted
TCS
2010
14 years 11 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...