1225 search results - page 71 / 245 » Maximal Consistent Subsets |
AIPS
2000
13 years 9 months ago
2000
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...
DM
2008
13 years 7 months ago
2008
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...
CSDA
2006
13 years 7 months ago
2006
Several methods to select variables that are subsequently used in discriminant analysis are proposed and analysed. The aim is to find from among a set of m variables a smaller sub...
JAL
2006
13 years 7 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
SIAMDM
2008
13 years 7 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...