4940 search results - page 571 / 988 » On the Complexity of Universal Programs |
285
click to vote
STOC
1993
ACM
15 years 11 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
188
click to vote
COCO
2004
Springer
15 years 10 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...
193
click to vote
KR
2000
Springer
15 years 10 months ago
2000
Springer
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
216
click to vote
CODES
2009
IEEE
15 years 10 months ago
2009
IEEE
Technological advancements due to Moore’s law have led to the proliferation of complex wireless sensor network (WSN) domains. One commonality across all WSN domains is the need ...
189
click to vote
CN
2010
15 years 6 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...