4004 search results - page 69 / 801 » How Many Packets Can We Encode |
115
click to vote
KCAP
2003
ACM
15 years 7 months ago
2003
ACM
Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the sam...
125
Voted
JANCL
2002
15 years 2 months ago
2002
Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such extensions is ...
121
click to vote
CTRSA
2007
Springer
15 years 8 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
136
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Recognition difficulty is statistically linked to ??? subject covariate factors such as age and gender for three face recognition algorithms: principle components analysis, an int...
106
Voted
AAAI
2008
15 years 4 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...