922 search results - page 42 / 185 » Engineering a complex ontology with time |
150
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
105
click to vote
KBSE
1995
IEEE
15 years 1 months ago
1995
IEEE
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
FSTTCS
2008
Springer
14 years 11 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...
AISADM
2005
Springer
15 years 3 months ago
2005
Springer
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...