14548 search results - page 101 / 2910 » The Optimal Path-Matching Problem |
150
click to vote
ACID
2006
15 years 3 months ago
2006
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
118
click to vote
CSL
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
114
click to vote
SAC
2005
ACM
15 years 7 months ago
2005
ACM
In this paper, we propose a multi-agent approach for solving a class of optimization problems involving expensive resources, where monolithic local search schemes perform miserabl...
124
click to vote
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— Many real-world problems demand a feasible solution to satisfy physical equilibrium, stability, or certain properties which require an additional lower level optimization probl...