3913 search results - page 673 / 783 » complexity 2006 |
CG
2006
Springer
14 years 10 months ago
2006
Springer
The investigation of molecular structures often requires the use of graphics software to display different representations of the molecule of interest. Unfortunately, the commonly...
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
112
click to vote
CORR
2006
Springer
14 years 10 months ago
2006
Springer
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
ECCC
2006
14 years 10 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
ENTCS
2006
14 years 10 months ago
2006
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex one...