Sciweavers

883 search results - page 162 / 177
» A Genetic Algorithm Applied to the Maximum Flow Problem
Sort
View
IJCAI
1997
13 years 8 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
ICONIP
2007
13 years 9 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
RECOMB
2005
Springer
14 years 7 months ago
Improved Recombination Lower Bounds for Haplotype Data
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
Vineet Bafna, Vikas Bansal
ICCV
2009
IEEE
15 years 14 days ago
Weakly supervised discriminative localization and classification: a joint learning process
Visual categorization problems, such as object classification or action recognition, are increasingly often approached using a detection strategy: a classifier function is first ...
Minh Hoai Nguyen, Lorenzo Torresani, Fernando de l...
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz