16843 search results - page 289 / 3369 » On Generalized Authorization Problems |
189
click to vote
IPL
2007
15 years 6 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
257
click to vote
FOGA
2011
14 years 10 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
205
click to vote
HYBRID
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
183
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
183
click to vote
FSTTCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...