4457 search results - page 412 / 892 » Tests of Machine Intelligence |
252
click to vote
TAINN
2005
Springer
16 years 1 months ago
2005
Springer
Satisfiability problem is an NP-complete problem that finds itself or its variants in many combinatorial problems. There exist many complete algorithms that give successful results...
169
click to vote
ICAIL
2003
ACM
16 years 27 days ago
2003
ACM
Effective retrieval of court decisions is important. Automatically identifying legal concepts in the decision texts would be very helpful. In this paper we investigate how a stat...
170
click to vote
AUSFORENSICS
2003
15 years 9 months ago
2003
This research looks at the efficiency of the honeyd honeypot system to reliably deceive intruders. Honeypots are being used as frontline network intelligence and forensic analysis...
174
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
204
click to vote
SWARM
2010
SPRINGER
15 years 6 months ago
2010
SPRINGER
Abstract. Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex function...