61 search results - page 5 / 13 » Towards an Efficient Implementation of Tree Automata Complet... |
SOSP
1997
ACM
13 years 9 months ago
1997
ACM
Despite a large research effort, software distributed shared memory systems have not been widely used to run parallel applications across clusters of computers. The higher perform...
SIGSOFT
2008
ACM
14 years 8 months ago
2008
ACM
Synthesis of system configurations from a given set of features is an important and very challenging problem. This paper makes a step towards this goal by describing an efficient ...
ESWS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Despite of their advertisement as task independent representations, the reuse of ontologies in different contexts is difficult. An explanation for this is that when devel...
ML
2007
ACM
13 years 7 months ago
2007
ACM
We develop new algorithms for learning monadic node selection queries in unranked trees from annotated examples, and apply them to visually interactive Web information extraction. ...
ROBOCUP
2000
Springer
13 years 11 months ago
2000
Springer
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...