Sciweavers

DSS
2000
94views more  DSS 2000»
13 years 4 months ago
Intelligent internet searching agent based on hybrid simulated annealing
Z .The World-Wide Web WWW based Internet services have become a major channel for information delivery. For the same reason, information overload also has become a serious problem...
Christopher C. Yang, Jerome Yen, Hsinchun Chen
CORR
2000
Springer
99views Education» more  CORR 2000»
13 years 4 months ago
Adaptive simulated annealing (ASA): Lessons learned
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using othe...
Lester Ingber
JSA
2007
191views more  JSA 2007»
13 years 4 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
IJAIT
2007
119views more  IJAIT 2007»
13 years 4 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
MOR
2006
81views more  MOR 2006»
13 years 4 months ago
Simulated Annealing for Convex Optimization
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
Adam Tauman Kalai, Santosh Vempala
JCP
2006
151views more  JCP 2006»
13 years 4 months ago
Simulated Annealing based Wireless Sensor Network Localization
In this paper, we describe a novel localization algorithm for ad hoc wireless sensor networks. Accurate selforganization and localization capability is a highly desirable character...
Anushiya A. Kannan, Guoqiang Mao, Branka Vucetic
COR
2008
118views more  COR 2008»
13 years 4 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
GECCO
2008
Springer
100views Optimization» more  GECCO 2008»
13 years 5 months ago
Optimizing hierarchical menus by genetic algorithm and simulated annealing
Hierarchical menus are now ubiquitous. The performance of the menu depends on many factors: structure, layout, colors and so on. There has been extensive research on novel menus, ...
Shouichi Matsui, Seiji Yamada
ISMB
1994
13 years 5 months ago
An Efficient Method for Multiple Sequence Alignment
Multiple sequence alignment has been a useful methodin the study of molecular evolution and sequence-structure relationships. This paper presents a newmethodfor multiple sequence ...
Jin Kim, Sakti Pramanik
WSCG
2004
155views more  WSCG 2004»
13 years 6 months ago
NURBS Fairing by Knot Vector Optimization
The shape of a NURBS curve or patch is defined by the location of its control points, the weights associated with these points, and the parameter intervals, also called the knot v...
Barnabás Aszódi, Szabolcs Czuczor, L...