Sciweavers

16091 search results - page 36 / 3219
» Solving
Sort
View
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 1 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 1 months ago
A Novel Multi-objective Orthogonal Simulated Annealing Algorithm for Solving Multi-objective Optimization Problems with a Large
In this paper, a novel multi-objective orthogonal simulated annealing algorithm MOOSA using a generalized Pareto-based scale-independent fitness function and multi-objective intell...
Li-Sun Shu, Shinn-Jang Ho, Shinn-Ying Ho, Jian-Hun...
ICALT
2003
IEEE
14 years 28 days ago
On Tools for Analysis of Collaborative Problem Solving
Analysis of collaborative problem solving involves analysis of dialogue and interaction, analysis of tasks and social roles through ethnographic and other field studies. Use of to...
Nikolaos M. Avouris, Vassilis Komis, Georgios Fiot...
CAV
2003
Springer
108views Hardware» more  CAV 2003»
14 years 26 days ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...
CP
2003
Springer
14 years 26 days ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin