Sciweavers

994 search results - page 25 / 199
» Custom Computing Machines for the Set Covering Problem
Sort
View
IJCAI
2007
13 years 9 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
ITICSE
2009
ACM
14 years 2 months ago
Hybrid and custom data structures: evolution of the data structures course
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
Daniel J. Ernst, Daniel E. Stevenson, Paul J. Wagn...
ICSE
2010
IEEE-ACM
14 years 15 days ago
Customized awareness: recommending relevant external change events
It is often assumed that developers’ view of their system and its environment is always consistent with everyone else’s; in practice, this assumption can be false, as the deve...
Reid Holmes, Robert J. Walker
DISOPT
2008
118views more  DISOPT 2008»
13 years 7 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
FCT
2009
Springer
14 years 2 months ago
Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
Peter Damaschke, Azam Sheikh Muhammad