6279 search results - page 1073 / 1256 » Studies in Solution Sampling |
148
click to vote
ORL
2000
15 years 4 months ago
2000
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
128
click to vote
SIAMJO
2000
15 years 4 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
139
click to vote
ADCM
1998
15 years 4 months ago
1998
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
148
click to vote
AMAI
1999
Springer
15 years 3 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
117
click to vote
DAM
1998
15 years 3 months ago
1998
We study a discrete problem of scheduling activities of several types under the constraint that at most a single activity can be scheduled to any one period. Applications of such ...