2412 search results - page 82 / 483 » Which Problems Have Strongly Exponential Complexity |
101
Voted
CCA
2000
Springer
15 years 5 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
118
Voted
NIPS
2004
15 years 2 months ago
2004
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
126
Voted
SOCO
2010
Springer
14 years 7 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
106
click to vote
HPCN
1995
Springer
15 years 4 months ago
1995
Springer
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
98
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...