2412 search results - page 212 / 483 » Which Problems Have Strongly Exponential Complexity |
111
click to vote
GECCO
2006
Springer
15 years 7 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 ...
117
click to vote
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
111
click to vote
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
140
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
We briefly present the current state-of-the-art approaches for group and extended object tracking with an emphasis on particle methods which have high potential to handle complex...
149
click to vote
CIKM
1998
Springer
15 years 8 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...