2412 search results - page 168 / 483 » Which Problems Have Strongly Exponential Complexity |
119
Voted
ANTSW
2006
Springer
15 years 7 months ago
2006
Springer
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
179
Voted
PKC
2000
Springer
15 years 7 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
124
Voted
TJS
2008
15 years 3 months ago
2008
Abstract Multiprocessor task scheduling is an important and computationally difficult problem. A large number of algorithms were proposed which represent various tradeoffs between ...
162
Voted
KDD
2010
ACM
15 years 7 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
141
Voted
ICFP
2010
ACM
15 years 3 months ago
2010
ACM
While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...