Sciweavers

10493 search results - page 154 / 2099
» Dynamic Word Problems
Sort
View
SAT
2007
Springer
146views Hardware» more  SAT 2007»
14 years 2 months ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
PEPM
1995
ACM
13 years 11 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
MP
2008
129views more  MP 2008»
13 years 8 months ago
Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
Florian A. Potra
IJAR
2007
48views more  IJAR 2007»
13 years 8 months ago
Using expert knowledge in solving the seismic inverse problem
For many practical applications, it it important to solve the seismic inverse problem, i.e., to measure seismic travel times and reconstruct velocities at different depths from t...
Matthew G. Averill, Kate C. Miller, G. Randy Kelle...
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 8 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis