Sciweavers

914 search results - page 110 / 183
» Analysis of Heuristic Synergies
Sort
View
CLEIEJ
2008
103views more  CLEIEJ 2008»
14 years 12 months ago
An Ontology-based Framework and its Application to Effective Collaboration
In the past few years Artificial Intelligence has been gradually introduced to enhance Education through technologies. However, usual approaches provide systems with a kind of exp...
Seiji Isotani, Riichiro Mizoguchi
90
Voted
EOR
2008
200views more  EOR 2008»
14 years 12 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
67
Voted
COMCOM
2006
75views more  COMCOM 2006»
14 years 12 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
IVC
2006
87views more  IVC 2006»
14 years 12 months ago
On the relation between Memon's and the modified Zeng's palette reordering methods
Palette reordering has been shown to be a very effective approach for improving the compression of color-indexed images by general purpose continuous-tone image coding techniques....
Armando J. Pinho, António J. R. Neves
MP
2006
123views more  MP 2006»
14 years 12 months ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...