1517 search results - page 188 / 304 » New Approach To A Class Of Matrices |
131
click to vote
NAA
2000
Springer
15 years 8 months ago
2000
Springer
In this work a grid free Monte Carlo algorithm for solving elliptic boundary value problems is investigated. The proposed Monte Carlo approach leads to a random process called a ba...
131
click to vote
AAAI
2008
15 years 7 months ago
2008
The paper presents a calculus based on resolution for credulous reasoning in Answer Set Programming. The new approach allows a top-down and goal directed resolution, in the same s...
151
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
139
click to vote
CPAIOR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
118
click to vote
FOSSACS
2008
Springer
15 years 6 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...