Sciweavers

388 search results - page 6 / 78
» The covering number in learning theory
Sort
View
DM
2010
102views more  DM 2010»
13 years 7 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
SIGCSE
2004
ACM
100views Education» more  SIGCSE 2004»
14 years 23 days ago
A visual and interactive automata theory course with JFLAP 4.0
We describe the instructional software JFLAP 4.0 and how it can be used to provide a hands-on formal languages and automata theory course. JFLAP 4.0 doubles the number of chapters...
Ryan Cavalcante, Thomas Finley, Susan H. Rodger
FOCS
1999
IEEE
13 years 11 months ago
An Algorithmic Theory of Learning: Robust Concepts and Random Projection
We study the phenomenon of cognitive learning from an algorithmic standpoint. How does the brain effectively learn concepts from a small number of examples despite the fact that e...
Rosa I. Arriaga, Santosh Vempala
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 8 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
14 years 1 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn