Sciweavers

7228 search results - page 313 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
MP
2008
115views more  MP 2008»
15 years 4 months ago
An efficient approach to updating simplex multipliers in the simplex algorithm
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
Jian-Feng Hu, Ping-Qi Pan
CN
2000
70views more  CN 2000»
15 years 4 months ago
An efficient algorithm to rank Web resources
How to rank Web resources is critical to Web Resource Discovery (Search Engine). This paper not only points out the weakness of current approaches, but also presents in-depth anal...
Dell Zhang, Yisheng Dong
122
Voted
CEC
2007
IEEE
15 years 11 months ago
On improving approximate solutions by evolutionary algorithms
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
Tobias Friedrich, Jun He, Nils Hebbinghaus, Frank ...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 11 months ago
Global multiobjective optimization via estimation of distribution algorithm with biased initialization and crossover
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...
MFCS
2005
Springer
15 years 10 months ago
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
Minming Li, Frances F. Yao