Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
The NP-completeness column: An ongoing guide
Journal of Algorithms
An introduction to structured modeling
Management Science
The formal aspects of structured modeling
Operations Research
Communications of the ACM
Attributed graphs, graph-grammars, and structured modeling
Annals of Operations Research - Special issue on model management in operations research
On the organization of large shared model bases
Annals of Operations Research - Special issue on model management in operations research
An implementation of a graph-based modeling system for structured modeling (GBMS/SM)
Decision Support Systems
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Information retrieval on the web
ACM Computing Surveys (CSUR)
A vision for management of complex models
ACM SIGMOD Record
Learning to map between ontologies on the semantic web
Proceedings of the 11th international conference on World Wide Web
Modern Information Retrieval
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Automatic Information Discovery from the "Invisible Web"
ITCC '02 Proceedings of the International Conference on Information Technology: Coding and Computing
Progress in Web-based decision support technologies
Decision Support Systems
The evolution of web-based optimisation: From ASP to e-Services
Decision Support Systems
Hi-index | 0.00 |
The number of available DSS within organizational Intranets will soon require efficient retrieval functionality. While Web retrieval technology performs excellent on documents, computational services need approaches that capture the semantics of resources. We present a retrieval approach that uses a variant of Structured Modeling to represent resources. It allows the use of similarity of models for retrieval. Exact similarity computation is shown to be NP-hard, and efficient heuristics for similarity computation and filter algorithms are introduced. We report an evaluation in a classroom experiment and give computational results on a benchmark library.