Sciweavers

263 search results - page 37 / 53
» Minimum Entropy Coloring
Sort
View
TCS
2010
14 years 10 months ago
Class constrained bin packing revisited
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
Leah Epstein, Csanád Imreh, Asaf Levin
IPL
2011
63views more  IPL 2011»
14 years 6 months ago
Edge-colored graphs with applications to homogeneous faults
In this paper, we use the concept of edge-colored graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirement...
Yongge Wang, Yvo Desmedt
ROBIO
2006
IEEE
110views Robotics» more  ROBIO 2006»
15 years 5 months ago
Sensor Based Localization for Mobile Robots by Exploration and Selection of Best Direction
Abstract— We present a strategy for resolving multiple hypotheses of a robot’s state during global localization. The strategy operates in two stages. In the first stage a uniq...
Rakesh Goyal, K. Madhava Krishna, Shivudu Bhuvanag...
IJCAI
1993
15 years 1 months ago
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
Usama M. Fayyad, Keki B. Irani
CORR
2010
Springer
90views Education» more  CORR 2010»
14 years 11 months ago
New Criteria for Iterative Decoding
Iterative decoding was not originally introduced as the solution to an optimization problem rendering the analysis of its convergence very difficult. In this paper, we investigate...
Florence Alberge, Ziad Naja, Pierre Duhamel