840 search results - page 103 / 168 » Inapproximability of Combinatorial Optimization Problems |
107
Voted
BIS
2008
15 years 1 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
100
Voted
EVOW
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. A methodology is presented for tackling mixed-integer nonlinear optimization problems by local search, in particular large-scale real-life problems. This methodology is i...
130
click to vote
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
90
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Efficient and effective deployment of IEEE 802.16 networks to service an area of users with certain traffic demands is an important network planning problem. We resort to an evol...
89
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper proposes an algorithm for combinatorial optimizations that uses reinforcement learning and estimation of joint probability distribution of promising solutions ...