1272 search results - page 163 / 255 » The Set Cover with Pairs Problem |
89
Voted
ISVD
2007
IEEE
15 years 7 months ago
2007
IEEE
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
111
click to vote
ICCTA
2007
IEEE
15 years 7 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
126
click to vote
AAAI
2008
15 years 3 months ago
2008
Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alterna...
129
click to vote
CONSTRAINTS
1999
15 years 11 days ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
85
Voted
ESOP
2001
Springer
15 years 5 months ago
2001
Springer
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...