14078 search results - page 359 / 2816 » Design and Analysis of Computer Algorithms |
147
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present an evolutionary methodology that explores the evolution of network topology when a uniform growth of the network traffic is considered. The network redesign problem is ...
234
click to vote
ENTCS
2006
15 years 6 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
213
click to vote
EUROPKI
2006
Springer
15 years 10 months ago
2006
Springer
Privacy-aware Public Key Infrastructure (PKI) can maintain user access control and yet protect user privacy, which is envisioned as a promising technique in many emerging applicat...
140
click to vote
ENGL
2007
15 years 6 months ago
2007
— Using computer simulated tests, this study examined direction-of-motion stereotypes and response times for different configurations of lever controls and circular displays. Qua...
186
click to vote
LICS
2003
IEEE
16 years 22 hour ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...