1772 search results - page 152 / 355 » Classifying Problems into Complexity Classes |
194
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
145
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
201
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
188
click to vote
ASWC
2009
Springer
15 years 9 months ago
2009
Springer
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
199
click to vote
LION
2007
Springer
16 years 18 days ago
2007
Springer
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...