1332 search results - page 175 / 267 » Combinatorial Algorithms |
EVOW
2007
Springer
14 years 3 months ago
2007
Springer
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel rando...
GECCO
2007
Springer
14 years 3 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
ISMVL
2006
IEEE
14 years 3 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
SEW
2006
IEEE
14 years 3 months ago
2006
IEEE
Pseudo-exhaustive testing uses the empirical observation that, for broad classes of software, a fault is likely triggered by only a few variables interacting. The method takes adv...
IWCMC
2006
ACM
14 years 3 months ago
2006
ACM
This paper presents a neural network model for routing in the space segment of a Satellite Personal Communication System. At first, a proper energy function is constructed from th...