Sciweavers

14649 search results - page 403 / 2930
» Principles of problem solving
Sort
View
GG
2008
Springer
15 years 7 months ago
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
Jérémie Chalopin, Antoni W. Mazurkie...
DISOPT
2008
93views more  DISOPT 2008»
15 years 6 months ago
Exploiting planarity in separation routines for the symmetric traveling salesman problem
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
Adam N. Letchford, Nicholas A. Pearson
COR
2006
88views more  COR 2006»
15 years 6 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
ITA
2008
123views Communications» more  ITA 2008»
15 years 6 months ago
On some problems related to palindrome closure
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
IPL
2006
67views more  IPL 2006»
15 years 6 months ago
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
Peter Damaschke