Sciweavers

4255 search results - page 203 / 851
» On Learning Boolean Functions
Sort
View
DLOG
2008
15 years 8 months ago
Identifying Objects Over Time with Description Logics
A fundamental requirement for cooperating agents is to agree on a selection of component values of objects that can be used for reliably communicating references to the objects, to...
David Toman, Grant E. Weddell
TCS
2010
15 years 4 months ago
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
Dirk Sudholt, Carsten Witt
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
16 years 24 days ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
PKDD
2007
Springer
146views Data Mining» more  PKDD 2007»
16 years 18 days ago
A Method for Multi-relational Classification Using Single and Multi-feature Aggregation Functions
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
Richard Frank, Flavia Moser, Martin Ester
AAAI
2008
15 years 8 months ago
Strategyproof Classification under Constant Hypotheses: A Tale of Two Functions
We consider the following setting: a decision maker must make a decision based on reported data points with binary labels. Subsets of data points are controlled by different selfi...
Reshef Meir, Ariel D. Procaccia, Jeffrey S. Rosens...