1220 search results - page 211 / 244 » Restricting grammatical complexity |
CN
2010
13 years 8 months ago
2010
Simulation is a cost effective, fast and flexible alternative to test-beds or practical deployment for evaluating the characteristics and potential of mobile ad hoc networks. Sinc...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
ENTCS
2008
13 years 8 months ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
BMCBI
2007
13 years 8 months ago
2007
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
TC
2008
13 years 8 months ago
2008
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...