6456 search results - page 45 / 1292 » Constraint Solving on Terms |
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
113
Voted
QSHINE
2005
IEEE
15 years 6 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
111
Voted
AI
2003
Springer
15 years 6 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
102
click to vote
BMCBI
2010
15 years 26 days ago
2010
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
142
Voted
GECCO
2009
Springer
14 years 10 months ago
2009
Springer
Public data sharing is utilized in a number of businesses to facilitate the exchange of information. Privacy constraints are usually enforced to prevent unwanted inference of info...