Sciweavers

14649 search results - page 301 / 2930
» Principles of problem solving
Sort
View
IJAC
2011
14 years 10 months ago
The Subword Reversing Method
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
Patrick Dehornoy
EVOW
2005
Springer
16 years 5 days ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
150
Voted
DISOPT
2007
90views more  DISOPT 2007»
15 years 6 months ago
On the job rotation problem
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...
Peter Butkovic, Seth Lewis
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 6 months ago
Views, Program Transformations, and the Evolutivity Problem
In this article, we argue that a program transformation approach is a good way to solve the tyranny of the primary decomposition. We illustrate our transformation-based approach o...
Julien Cohen, Rémi Douence
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 6 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica