Sciweavers

29908 search results - page 348 / 5982
» On the Complexity of
Sort
View
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
16 years 29 days ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
ICALP
2007
Springer
16 years 29 days ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
ICCS
2007
Springer
16 years 29 days ago
Reducing the Representation Complexity of Lattice-Based Taxonomies
Abstract. Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of...
Sergei O. Kuznetsov, Sergei A. Obiedkov, Camille R...
ICIC
2007
Springer
16 years 29 days ago
An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization
: - This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of ...
Yan Luo, Changrui Yu
ISVC
2007
Springer
16 years 28 days ago
Learning to Recognize Complex Actions Using Conditional Random Fields
Surveillance systems that operate continuously generate large volumes of data. One such system is described here, continuously tracking and storing observations taken from multiple...
Christopher I. Connolly