Sciweavers

1816 search results - page 20 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CAEPIA
2003
Springer
15 years 11 months ago
A New Genetic Approach for the Partitioning Problem in Distributed Virtual Environment Systems
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 ...
Pedro Morillo, Pedro López, Juan M. Ordu&nt...
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
15 years 9 months ago
A new approach for shortest path routing problem by random key-based GA
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...
Mitsuo Gen, Lin Lin
NA
2010
235views more  NA 2010»
15 years 23 days ago
On new iterative method for solving systems of nonlinear equations
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...
Fadi Awawdeh
ICCV
2011
IEEE
14 years 6 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
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...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
CP
2005
Springer
15 years 11 months ago
Solving Over-Constrained Problems with SAT
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...
Josep Argelich, Felip Manyà