4894 search results - page 528 / 979 » The Guarding Problem - Complexity and Approximation |
146
click to vote
CPM
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
144
click to vote
WIDM
2006
ACM
15 years 10 months ago
2006
ACM
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
121
click to vote
APSEC
2000
IEEE
15 years 9 months ago
2000
IEEE
It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modell...
127
click to vote
STOC
1999
ACM
15 years 9 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
158
click to vote
RANDOM
1998
Springer
15 years 9 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...