434 search results - page 68 / 87 » Embedded Intelligence |
TPHOL
2008
IEEE
15 years 5 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
84
Voted
FUZZIEEE
2007
IEEE
15 years 5 months ago
2007
IEEE
— DNA sequence basecalling is commonly regarded as a solved problem, despite significant error rates being reflected in inaccuracies in databases and genome annotations. This has...
96
Voted
FUZZIEEE
2007
IEEE
15 years 5 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
The majority of existing work on agent dialogues considers negotiation, persuasion or deliberation dialogues. We focus on inquiry dialogues that allow two agents to share knowledg...
GPCE
2007
Springer
15 years 5 months ago
2007
Springer
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...