8413 search results - page 158 / 1683 » Ordering Problem Subgoals |
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
Case-based reasoning (CBR) aims at using experience from the past in order to guide future problem solving rather than “starting from scratch” every time. We propose a CBR stra...
SETA
2004
Springer
14 years 3 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
EMMCVPR
2001
Springer
14 years 2 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
ECAI
2008
Springer
14 years 5 days ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
AAIM
2008
Springer
14 years 4 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...