15033 search results - page 68 / 3007 » Complexity Theory and Algorithms |
133
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
106
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
135
Voted
JAPLL
2006
15 years 3 months ago
2006
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
123
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
150
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...