Sciweavers

7123 search results - page 1213 / 1425
» The Ordered Set of Rough Sets
Sort
View
IOR
2002
135views more  IOR 2002»
15 years 6 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
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...
J. G. Dai, Gideon Weiss
JMLR
2002
89views more  JMLR 2002»
15 years 6 months ago
A Robust Minimax Approach to Classification
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...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
SIGPLAN
2002
15 years 6 months ago
Write barrier removal by static analysis
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...
Karen Zee, Martin C. Rinard
TSE
2002
105views more  TSE 2002»
15 years 6 months ago
Disaggregating and Calibrating the CASE Tool Variable in COCOMO II
CASE (Computer Aided Software Engineering) tools are believed to have played a critical role in improving software productivity and quality by assisting tasks in software developme...
Jongmoon Baik, Barry W. Boehm, Bert Steece
MSCS
2007
125views more  MSCS 2007»
15 years 6 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
« Prev « First page 1213 / 1425 Last » Next »