Sciweavers

3818 search results - page 97 / 764
» Word Problems on Compressed Words
Sort
View
150
Voted
ITS
2010
Springer
182views Multimedia» more  ITS 2010»
15 years 3 months ago
An Interactive Learning Environment for Problem-Changing Exercise
: To make a new problem from the original one and to compare their solutions are promising activities to promote a learner to be aware of the structure of these problems. Especiall...
Tsukasa Hirashima, Sho Yamamoto, Hiromi Waki
128
Voted
NA
2010
62views more  NA 2010»
15 years 3 months ago
Noise-reducing cascadic multilevel methods for linear discrete ill-posed problems
Cascadic multilevel methods for the solution of linear discrete ill-posed problems with noise-reducing restriction and prolongation operators recently have been developed for the r...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
PDP
2002
IEEE
15 years 9 months ago
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
Zbigniew J. Czech, Piotr Czarnas
JCAM
2010
84views more  JCAM 2010»
14 years 11 months ago
An interior-point method for large constrained discrete ill-posed problems
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
Serena Morigi, Lothar Reichel, Fiorella Sgallari
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
15 years 10 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...