4617 search results - page 842 / 924 » Automation of Diagrammatic Reasoning |
197
click to vote
KIVS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. Semantic Web services envision the automated discovery and selection of Web services. This can be realised by adding semantic information to advertised services and servi...
192
click to vote
LACL
2005
Springer
16 years 8 days ago
2005
Springer
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
131
click to vote
LACL
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
153
click to vote
LPAR
2005
Springer
16 years 8 days ago
2005
Springer
We present an algorithm for the conversion of very weak alternating Büchi automata into nondeterministic Büchi automata (NBA), and we introduce a local optimization criterion fo...
171
click to vote
LPAR
2005
Springer
16 years 8 days ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...