612 search results - page 24 / 123 » Hardness assumptions in the foundations of theoretical compu... |
ADAEUROPE
2010
Springer
15 years 2 months ago
2010
Springer
Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including high-reliability embedded real-time sy...
GI
2010
Springer
14 years 8 months ago
2010
Springer
: This paper presents a framework for Service Level Management in dynamic, heterogeneous environments for service composition. Assumptions to and the architecture of a framework is...
106
click to vote
CSR
2007
Springer
15 years 4 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
DCC
2000
IEEE
14 years 9 months ago
2000
IEEE
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
AI
2008
Springer
14 years 10 months ago
2008
Springer
Stochastic local search (SLS) algorithms have recently been proven to be among the best approaches to solving computationally hard problems. SLS algorithms typically have a number...