976 search results - page 12 / 196 » The Complexity of Timetable Construction Problems |
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
IDA
2003
Springer
13 years 12 months ago
2003
Springer
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
VL
1998
IEEE
13 years 11 months ago
1998
IEEE
A powerful and useful Data-Flow Visual Programming Language (DFVPL) must provide the necessary programming constructs to deal with complex problems. The main purpose of this paper...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
The Web Service Composition (WSC) problem on behavioral descriptions deals with the automatic construction of a coordinator web service to control a set of web services to reach t...
MFCS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...