Sciweavers

994 search results - page 80 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
112
Voted
FPGA
1999
ACM
142views FPGA» more  FPGA 1999»
15 years 5 months ago
Multi-Terminal Net Routing for Partial Crossbar-Based Multi-FPGA Systems
Multi-FPGA systems are used as custom computing machines to solve compute intensive problems and also in the verification and prototyping of large circuits. In this paper, we addr...
Abdel Ejnioui, N. Ranganathan
97
Voted
ICML
1995
IEEE
15 years 4 months ago
Learning with Rare Cases and Small Disjuncts
Systems that learn from examples often create a disjunctive concept definition. Small disjuncts are those disjuncts which cover only a few training examples. The problem with sma...
Gary M. Weiss
FOCS
2004
IEEE
15 years 4 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
95
Voted
AAAI
2008
15 years 3 months ago
Zero-data Learning of New Tasks
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
Hugo Larochelle, Dumitru Erhan, Yoshua Bengio
HIS
2004
15 years 2 months ago
A Case-Based Recommender for Task Assignment in Heterogeneous Computing Systems
Case-based reasoning (CBR) is a knowledge-based problem-solving technique, which is based on reuse of previous experiences. In this paper we propose a new model for static task as...
S. Ghanbari, Mohammad Reza Meybodi, Kambiz Badie