16596 search results - page 185 / 3320 » Generalized Assignment Problems |
143
click to vote
ICRA
2007
IEEE
16 years 20 days ago
2007
IEEE
Abstract— To coordinate a team of robots for exploration is a challenging problem, particularly in large areas as for example the devastated area after a disaster. This problem c...
173
Voted
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
A central problem in the algorithmic study of lattices is the closest vector problem: given a lattice v represented by some basis, and a target point y, nd the lattice point close...
184
click to vote
NIPS
2001
15 years 7 months ago
2001
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class...
161
Voted
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
143
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Given a hypergraph H = (V, E), a coloring of its vertices is said to be conflict-free if for every hyperedge S ∈ E there is at least one vertex in S whose color is distinct fro...