3946 search results - page 225 / 790 » The computational complexity of choice sets |
176
click to vote
APAL
2007
15 years 6 months ago
2007
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
186
click to vote
TCS
2010
15 years 1 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
201
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
170
click to vote
IEEESCC
2008
IEEE
16 years 1 months ago
2008
IEEE
Service-orientation enables cooperation between multiple organizations and has become a solution of choice to tackle the complexity of ubiquitous computing. The very nature of ubi...
155
click to vote
IPPS
2007
IEEE
16 years 29 days ago
2007
IEEE
Data prefetching, where data is fetched before CPU demands for it, has been considered as an effective solution to mask data access latency. However, the current client-initiated ...