Sciweavers

1074 search results - page 80 / 215
» An ASM-Characterization of a Class of Distributed Algorithms
Sort
View
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
AI
2003
Springer
15 years 3 months ago
Iterated Robust Tabu Search for MAX-SAT
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Kevin Smyth, Holger H. Hoos, Thomas Stützle
CORR
2008
Springer
72views Education» more  CORR 2008»
14 years 10 months ago
Statistical Learning of Arbitrary Computable Classifiers
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
David Soloveichik
ICASSP
2011
IEEE
14 years 1 months ago
Phoneme selective speech enhancement using the generalized parametric spectral subtraction estimator
In this study, the generalized parametric spectral subtraction estimator is employed in the context of a ROVER speech enhancement framework to develop a robust phoneme class selec...
Amit Das, John H. L. Hansen
ALT
1999
Springer
15 years 2 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz