Sciweavers

1289 search results - page 208 / 258
» Flexible Language Interoperability
Sort
View
AAMAS
2002
Springer
13 years 9 months ago
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and eff...
Katia P. Sycara, Seth Widoff, Matthias Klusch, Jia...
PRL
2002
94views more  PRL 2002»
13 years 9 months ago
A hierarchical tag-graph search scheme with layered grammar rules for spontaneous speech understanding
It has always been difficult for language understanding systems to handle spontaneous speech with satisfactory robustness, primarily due to such problems as the fragments, disflue...
Bor-shen Lin, Berlin Chen, Hsin-Min Wang, Lin-Shan...
ICGI
2010
Springer
13 years 8 months ago
Exact DFA Identification Using SAT Solvers
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
Marijn J. H. Heule, Sicco Verwer
ACL
2009
13 years 7 months ago
Insights into Non-projectivity in Hindi
Large scale efforts are underway to create dependency treebanks and parsers for Hindi and other Indian languages. Hindi, being a morphologically rich, flexible word order language...
Prashanth Mannem, Himani Chaudhry, Akshar Bharati
COORDINATION
2009
Springer
13 years 7 months ago
Automata for Context-Dependent Connectors
Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. For maximum flexibility and reuse, s...
Marcello M. Bonsangue, Dave Clarke, Alexandra Silv...