2412 search results - page 256 / 483 » Which Problems Have Strongly Exponential Complexity |
146
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
152
Voted
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Application-layer overlay networks have recently emerged as a promising solution for live media multicast on the Internet. A tree is probably the most natural structure for a mult...
121
Voted
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
133
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
149
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...