9842 search results - page 1589 / 1969 » The Complexity of the Matching-Cut Problem |
167
click to vote
CIAC
2003
Springer
16 years 2 hour ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
227
click to vote
MMB
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
195
click to vote
EMO
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
187
click to vote
CONCUR
2000
Springer
15 years 11 months ago
2000
Springer
In the synchronous composition of processes, one process may prevent another process from proceeding unless compositions without a wellde ned productbehavior are ruled out. They ca...
233
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Both detection and tracking people are challenging problems, especially in complex real world scenes that commonly involve multiple people, complicated occlusions, and cluttered o...