Sciweavers

JMLR
2002
89views more  JMLR 2002»
13 years 7 months ago
The Set Covering Machine
We extend the classical algorithms of Valiant and Haussler for learning compact conjunctions and disjunctions of Boolean attributes to allow features that are constructed from the...
Mario Marchand, John Shawe-Taylor
IWC
1998
109views more  IWC 1998»
13 years 7 months ago
About the importance of auditory alarms during the operation of a plant simulator
An experiment was carried out to estimate the effect of auditory alarms on the work of an plant operator in the context of a computer simulation. We designed our process simulator...
Matthias Rauterberg
IGPL
1998
115views more  IGPL 1998»
13 years 7 months ago
Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding -conversion and being as close to machines as possible. De Bru...
Fairouz Kamareddine, Alejandro Ríos
FMSD
1998
60views more  FMSD 1998»
13 years 7 months ago
The General Product Machine: a New Model for Symbolic FSM Traversal
Proving the equivalenceof two Finite State Machines (FSMs) has many applications to synthesis, veri cation, testing, and diagnosis. Building their product machine is a theoretical ...
Gianpiero Cabodi, Paolo Camurati, Fulvio Corno, Pa...
IOR
2002
135views more  IOR 2002»
13 years 7 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
ACTA
1998
111views more  ACTA 1998»
13 years 7 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
PC
2000
95views Management» more  PC 2000»
13 years 7 months ago
Massively parallel computing using commodity components
The Computational Plant (Cplant) project at Sandia National Laboratories is developing a large-scale, massively parallel computing resource from a cluster of commodity computing a...
Ron Brightwell, Lee Ann Fisk, David S. Greenberg, ...
MST
2000
86views more  MST 2000»
13 years 7 months ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
CANDC
2002
ACM
13 years 7 months ago
Drug Design by Machine Learning: Support Vector Machines for Pharmaceutical Data Analysis
We show that the support vector machine (SVM) classification algorithm, a recent development from the machine learning community, proves its potential for structure
Robert Burbidge, Matthew W. B. Trotter, Bernard F....
AROBOTS
2002
67views more  AROBOTS 2002»
13 years 7 months ago
A System for Semi-Autonomous Tractor Operations
Tractors are the workhorses of the modern farm. By automating these machines, we can increase the productivity, improve safety, and reduce costs for many agricultural operations. ...
Anthony Stentz, Cristian Dima, Carl Wellington, He...