Sciweavers

2412 search results - page 327 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
FASE
2010
Springer
14 years 5 months ago
Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization
This paper1 provides a motivation for the application of search based optimization to Software Engineering, an area that has come to be known as Search Based Software Engineering (...
Mark Harman
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
14 years 4 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
COMPSAC
2008
IEEE
14 years 4 months ago
Managing Libre Software Distributions under a Product Line Approach
Software product lines have already proven to be a successful methodology for building and maintaining a collection of similar software products, based on a common architecture. H...
Israel Herraiz, Gregorio Robles, Rafael Capilla, J...
IPPS
2008
IEEE
14 years 4 months ago
A study of master-slave approaches to parallelize NSGA-II
Many of the optimization problems from the real world are multiobjective in nature, and the reference algorithm for multiobjective optimization is NSGA-II. Frequently, these probl...
Juan José Durillo, Antonio J. Nebro, Franci...
IPPS
2007
IEEE
14 years 4 months ago
Security Threat Prediction in a Local Area Network Using Statistical Model
In today’s large and complex network scenario vulnerability scanners play a major role from security perspective by proactively identifying the known security problems or vulner...
Somak Bhattacharya, S. K. Ghosh