8201 search results - page 1513 / 1641 » Approaching Manual Intelligence |
131
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
138
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
115
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
162
click to vote
DBISP2P
2005
Springer
15 years 9 months ago
2005
Springer
Intelligent Web search engines are extremely popular now. Currently, only commercial centralized search engines like Google can process terabytes of Web data. Alternative search en...
165
Voted
DRM
2005
Springer
15 years 9 months ago
2005
Springer
A software obfuscator is a program O to transform a source program P for protection against malicious reverse engineering. O should be correct (O(P) has same functionality with P)...