Sciweavers

103 search results - page 19 / 21
» A new heuristic for the quadratic assignment problem
Sort
View
FLAIRS
2006
13 years 8 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch
ML
2008
ACM
101views Machine Learning» more  ML 2008»
13 years 7 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
KSEM
2009
Springer
14 years 2 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
CORR
2002
Springer
123views Education» more  CORR 2002»
13 years 7 months ago
Survey propagation: an algorithm for satisfiability
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
Alfredo Braunstein, Marc Mézard, Riccardo Z...
IPPS
2010
IEEE
13 years 5 months ago
Towards dynamic reconfigurable load-balancing for hybrid desktop platforms
s the Pus using the OpenCL API as the platform independent programming model. It has the proposal to extend OpenCL with a module that schedule and balance the workload over the CPU...
Alécio Pedro Delazari Binotto, Carlos Eduar...