9719 search results - page 1812 / 1944 » Answer Set Optimization |
IOR
2002
14 years 10 months ago
2002
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
INFORMS
1998
14 years 10 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
95
Voted
JMLR
2002
14 years 10 months ago
2002
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
76
Voted
ORL
1998
14 years 10 months ago
1998
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
103
click to vote
SIGPLAN
2002
14 years 9 months ago
2002
We present a new analysis for removing unnecessary write barriers in programs that use generational garbage collection. To our knowledge, this is the first static program analysis...