1816 search results - page 20 / 364 » A New Approach for Solving the Maximum Clique Problem |
113
click to vote
CAEPIA
2003
Springer
15 years 5 months ago
2003
Springer
The Partitioning problem is a key issue in the design of Distributed Virtual Environment (DVE) systems based on a server-network architecture. This problem consist of efficiently ...
GECCO
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
143
click to vote
NA
2010
14 years 6 months ago
2010
Solving systems of nonlinear equations is a relatively complicated problem for which a number of different approaches have been proposed. In this paper, we employ the Homotopy Anal...
120
click to vote
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
103
click to vote
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...