1199 search results - page 108 / 240 » Parameterized Proof Complexity |
INFSOF
2000
13 years 9 months ago
2000
We construct models as an aid to our thought process. A particular class of models, operational models, can be used for simulation and prototyping. The Opj modeling language is su...
SP
2002
IEEE
13 years 9 months ago
2002
IEEE
The design and prototype implementation of the XCAT Grid Science Portal is described in this paper. The portal lets grid application programmers easily script complex distributed ...
ISAAC
2010
Springer
13 years 8 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
ICC
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract—We develop a family of distributed wireless scheduling algorithms that requires only O(1) complexity for M-hop interference model, for any finite M. The recent technolo...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Network protocol system fingerprinting has been recognized as an important issue and a major threat to network security. Prevalent works rely largely on human experiences and i...