Sciweavers

815 search results - page 65 / 163
» Approximate Entropy Reducts
Sort
View
ATAL
2007
Springer
15 years 3 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
107
Voted
ISCI
2008
124views more  ISCI 2008»
14 years 12 months ago
A weighted rough set based method developed for class imbalance learning
In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the clas...
Jinfu Liu, Qinghua Hu, Daren Yu
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
15 years 6 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
IPL
2010
114views more  IPL 2010»
14 years 10 months ago
Alphabetic coding with exponential costs
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
Michael B. Baer
ICIP
2010
IEEE
14 years 9 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard