696 search results - page 40 / 140 » A class of combinatorial identities |
AI
2009
Springer
15 years 8 months ago
2009
Springer
In many practical domains, misclassification costs can differ greatly and may be represented by class ratios, however, most learning algorithms struggle with skewed class distrib...
104
click to vote
IROS
2009
IEEE
15 years 8 months ago
2009
IEEE
— We address the mutual localization problem for a multi-robot system, under the assumption that each robot is equipped with a sensor that provides a measure of the relative posi...
117
click to vote
SARA
2007
Springer
15 years 8 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
124
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
133
click to vote
CATS
2006
15 years 3 months ago
2006
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...