3913 search results - page 158 / 783 » complexity 2006 |
JSYML
2006
15 years 4 months ago
2006
We investigate diagonal actions of Polish groups and the related intersection operator on closed subgroups of the acting group. The Borelness of the diagonal orbit equivalence rela...
122
click to vote
ISJ
2000
15 years 3 months ago
2000
The last dozen years have seen a considerable investment of resources into the research and development of Group Support Systems (GSS) technology. This paper describes how a GSS w...
118
click to vote
IPL
2010
15 years 2 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
117
click to vote
FASE
2010
Springer
15 years 11 months ago
2010
Springer
f abstraction, providing an effective way to discover a Web service based on its interface. Awards and Scholarships - Ontario Graduate Scholarship (OGS), 2008 - Ontario Graduate S...
133
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...