Sciweavers

4255 search results - page 158 / 851
» On Learning Boolean Functions
Sort
View
92
Voted
SCP
1998
134views more  SCP 1998»
14 years 9 months ago
Abstract Interpretation Using Typed Decision Graphs
Interpretation Using Typed Decision Graphs Laurent Mauborgne LIENS, ´Ecole Normale Sup´erieure, 45 rue d’Ulm, 75230 Paris cedex 05, France Abstract. This article presents a way...
Laurent Mauborgne
JUCS
2010
143views more  JUCS 2010»
14 years 8 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
ICMLA
2009
14 years 7 months ago
Discovering Characterization Rules from Rankings
For many ranking applications we would like to understand not only which items are top-ranked, but also why they are top-ranked. However, many of the best ranking algorithms (e.g....
Ansaf Salleb-Aouissi, Bert C. Huang, David L. Walt...
LFCS
1992
Springer
15 years 2 months ago
Machine Learning of Higher Order Programs
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
Ganesh Baliga, John Case, Sanjay Jain, Mandayam Su...
ICPR
2008
IEEE
15 years 11 months ago
Collaborative learning by boosting in distributed environments
In this paper we propose a new distributed learning method called distributed network boosting (DNB) algorithm for distributed applications. The learned hypotheses are exchanged b...
Shijun Wang, Changshui Zhang