7006 search results - page 918 / 1402 » Approximation Algorithms |
218
click to vote
SIGIR
2004
ACM
16 years 1 months ago
2004
ACM
Web-page classification is much more difficult than pure-text classification due to a large variety of noisy information embedded in Web pages. In this paper, we propose a new Web...
175
click to vote
ICASSP
2009
IEEE
16 years 2 months ago
2009
IEEE
Due to their computational efficiency and strong empirical performance, semidefinite relaxation (SDR)–based algorithms have gained much attention in multiple–input multiple...
212
click to vote
ICCBR
2001
Springer
16 years 2 days ago
2001
Springer
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...
200
click to vote
CPAIOR
2006
Springer
15 years 11 months ago
2006
Springer
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
216
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...