5316 search results - page 1021 / 1064 » Which Search Problems Are Random |
117
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
115
click to vote
SIGCOMM
2010
ACM
15 years 29 days ago
2010
ACM
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...
151
click to vote
BMCBI
2008
15 years 27 days ago
2008
Background: A fundamental problem when trying to define the functional relationships between proteins is the difficulty in quantifying functional similarities, even when well-stru...
BMCBI
2007
15 years 27 days ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
108
Voted
CONSTRAINTS
2006
15 years 24 days ago
2006
Constraint satisfaction problems (CSPs) sometimes contain both variable symmetries and value symmetries, causing adverse effects on CSP solvers based on tree search. As a remedy, s...