3172 search results - page 59 / 635 » On the Random-Self-Reducibility of Complete Sets |
101
Voted
JAIR
2007
15 years 19 days ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
127
click to vote
RTA
1995
Springer
15 years 4 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
104
Voted
EAAI
2008
15 years 24 days ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
73
Voted
RTA
1993
Springer
15 years 4 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
95
Voted
NIPS
2001
15 years 2 months ago
2001
Partial information can trigger a complete memory. At the same time, human memory is not perfect. A cue can contain enough information to specify an item in memory, but fail to tr...