438 search results - page 49 / 88 » A (1-1 e)-approximation algorithm for the generalized assign... |
JAL
2006
13 years 7 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents a communication-less multi-agent task allocation procedure that allows agents to use past experience to make non-greedy decisions about task assignments. Exper...
GC
2007
Springer
13 years 7 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
JMLR
2006
13 years 7 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...