2778 search results - page 26 / 556 » Limit complexities revisited |
104
click to vote
HICSS
2003
IEEE
15 years 3 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
102
click to vote
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Particle Swarm Optimization (PSO) is a population-based optimization method in which search points employ a cooperative strategy to move toward one another. In this paper we show ...
CRYPTO
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
100
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...