Web newspaper layout optimization using simulated annealing

Authors:
J. Gonzalez;I. Rojas;H. Pomares;M. Salmeron;J. J. Merelo
Affiliations:
Dept. of Comput. Archit. & Comput. Technol., Granada Univ.;-;-;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2002

Citing 0
Cited 6

Meta-Heuristic Algorithms for FPGA Segmented Channel Routing Problems with Non-standard Cost Functions

Genetic Programming and Evolvable Machines
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems

Computers and Operations Research
Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems

Computers and Operations Research
Letters: Using a bank of binary Hopfield networks as constraints solver in hybrid algorithms

Neurocomputing
A simulated annealing approach to speaker segmentation in audio databases

Engineering Applications of Artificial Intelligence
Hybrid meta-heuristics algorithms for task assignment in heterogeneous computing systems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Web newspaper pagination problem consists of optimizing the layout of a set of articles extracted from several Web newspapers and sending it to the user as the result of a previous query. This layout should be organized in columns, as in real newspapers, and should be adapted to the client Web browser configuration in real time. This paper presents an approach to the problem based on simulated annealing (SA) that solves the problem on-line, adapts itself to the client's computer configuration, and supports articles with different widths.