Sciweavers

10568 search results - page 234 / 2114
» Computer Intelligence and Formalization
Sort
View
JCST
2010
189views more  JCST 2010»
14 years 10 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
LREC
2008
134views Education» more  LREC 2008»
15 years 4 months ago
An AI-inspired intelligent agent/student architecture to combine Language Resources research and teaching
This paper describes experimental use of the multi-agent architecture to integrate Natural Language and Information Systems research and teaching, by casting a group of students a...
Bayan Abu Shawar, Eric Atwell
AGI
2011
14 years 6 months ago
Structural Emergence in Partially Ordered Sets Is the Key to Intelligence
Extraordinary structural organization known as emergence is observed in partially ordered sets when a recently discovered functional is minimized. Emergence creates the first stru...
Sergio Pissanetzky
COORDINATION
2008
Springer
15 years 5 months ago
Formalizing Higher-Order Mobile Embedded Business Processes with Binding Bigraphs
Abstract. We propose and formalize HomeBPEL, a higher-order WSBPEL-like business process execution language where processes are firstclass values that can be stored in variables, p...
Mikkel Bundgaard, Arne J. Glenstrup, Thomas T. Hil...
CLA
2004
15 years 4 months ago
Using Concept Formal Analysis for Cooperative Information Retrieval
cessary to abstract it and eliminate the redundancy data. In this context, a method for data reduction based on the formal concept analysis is proposed in [16,17]. At the same time...
Ibtissem Nafkha, Samir Elloumi, Ali Jaoua