9842 search results - page 408 / 1969 » The Complexity of the Matching-Cut Problem |
125
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
141
click to vote
FOSSACS
2012
Springer
14 years 7 days ago
2012
Springer
We consider concurrent games played on graphs, in which each player has several qualitative (e.g. reachability or B¨uchi) objectives, and a preorder on these objectives (for insta...
121
click to vote
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
139
Voted
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
137
Voted
FOSAD
2000
Springer
15 years 8 months ago
2000
Springer
This material was presented in a series of lectures at fosad, a summer school on Foundations of Security Analysis and Design, at the University of Bologna Center at Bertinoro in Se...