3758 search results - page 205 / 752 » A Complete Subsumption Algorithm |
102
click to vote
EOR
2008
15 years 2 months ago
2008
This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxe...
108
click to vote
IJCM
2008
15 years 2 months ago
2008
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
101
click to vote
JSC
2008
15 years 2 months ago
2008
Abstract. Flat theory with sequence variables and flexible arity symbols has infinitary matching and unification type. Decidability of general unification is shown and a unificatio...
103
Voted
MSCS
2008
15 years 2 months ago
2008
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
104
click to vote
CI
2004
15 years 2 months ago
2004
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...