Sciweavers

418 search results - page 3 / 84
» A relaxation-based algorithm for solving the conditional p-c...
Sort
View
MOC
1998
64views more  MOC 1998»
13 years 7 months ago
Analysis of non-overlapping domain decomposition algorithms with inexact solves
In this paper we construct and analyze new non-overlapping domain decomposition preconditioners for the solution of second-order elliptic and parabolic boundary value problems. The...
James H. Bramble, Joseph E. Pasciak, Apostol T. Va...
ANOR
2008
171views more  ANOR 2008»
13 years 7 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 1 months ago
ACO vs EAs for solving a real-world frequency assignment problem in GSM networks
Frequency planning is a very important task for current GSM operators. In this work we present a new mathematical formulation of the problem in which the frequency plans are evalu...
Francisco Luna, Christian Blum, Enrique Alba, Anto...
INFORMATICALT
2006
77views more  INFORMATICALT 2006»
13 years 7 months ago
Parallel Numerical Algorithms for 3D Parabolic Problem with Nonlocal Boundary Condition
Three parallel algorithms for solving the 3D problem with nonlocal boundary condition are considered. The forward and backward Euler finite-difference schemes, and LOD scheme are t...
Raimondas Ciegis
AAAI
2006
13 years 9 months ago
Extending Dynamic Backtracking to Solve Weighted Conditional CSPs
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
Robert T. Effinger, Brian C. Williams