1683 search results - page 285 / 337 » Game Theory Basics |
136
click to vote
MM
2005
ACM
15 years 9 months ago
2005
ACM
Latent Semantic Analysis (LSA) has shown encouraging performance for the problem of unsupervised image automatic annotation. LSA conducts annotation by keywords propagation on a l...
130
click to vote
BIRTHDAY
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
118
click to vote
EMO
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Evolutionary algorithms have been quite effective in dealing with single-objective “optimization” while the area of Evolutionary Multiobjective Optimization (EMOO) h...
120
click to vote
FOSSACS
2005
Springer
15 years 9 months ago
2005
Springer
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
123
click to vote
ICDT
2005
ACM
15 years 9 months ago
2005
ACM
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...