3946 search results - page 400 / 790 » The computational complexity of choice sets |
203
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
237
click to vote
FAABS
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Agent-based systems that are composed of simple locally interacting agents but which demonstrate complex group behavior o er several advantages over traditional multi-age...
214
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
230
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
174
click to vote
EUROPAR
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Accurately modeling and predicting performance for largescale applications becomes increasingly difficult as system complexity scales dramatically. Analytic predictive mo...