922 search results - page 78 / 185 » Engineering a complex ontology with time |
148
click to vote
WSC
2000
15 years 7 months ago
2000
This paper discusses a Web-based simulation manager program that executes an Application Service Provider (ASP) event for a customer who does not possess the inhouse capability to...
167
click to vote
CSC
2008
15 years 7 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
147
click to vote
SERA
2005
Springer
15 years 12 months ago
2005
Springer
In recent years, embedded systems have become so complex and the development time to market is required to be shorter than before. As embedded systems include more functions for n...
158
click to vote
WECWIS
2003
IEEE
15 years 11 months ago
2003
IEEE
With the growing number of marketplaces and trading partners in the e–commerce environment, software tools designed to act on behalf of human traders are increasingly used to au...
175
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...