2398 search results - page 338 / 480 » Constraint Programming and Graph Algorithms |
136
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
156
click to vote
EOR
2008
15 years 5 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
165
click to vote
JMMA
2002
15 years 4 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
127
click to vote
SIGCSE
2004
ACM
15 years 10 months ago
2004
ACM
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
141
Voted
DAM
2002
15 years 4 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...