Sciweavers

4355 search results - page 72 / 871
» Increasing Kolmogorov Complexity
Sort
View
TEC
2002
183views more  TEC 2002»
13 years 8 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
PC
2010
111views Management» more  PC 2010»
13 years 7 months ago
Reducing complexity in tree-like computer interconnection networks
The fat-tree is one of the topologies most widely used to build high-performance parallel computers. However, they are expensive and difficult to build. In this paper we propose t...
Javier Navaridas, José Miguel-Alonso, Franc...
SEKE
2010
Springer
13 years 7 months ago
Ontology-Based Test Case Generation For Simulating Complex Production Automation Systems
—The behavior of complex production automation systems is hard to predict, therefore simulation is used to study the likely system behavior. However, in a real-world system many ...
Thomas Moser, Gregor Dürr, Stefan Biffl
SIGDIAL
2010
13 years 6 months ago
Dialogue Act Modeling in a Complex Task-Oriented Domain
Classifying the dialogue act of a user utterance is a key functionality of a dialogue management system. This paper presents a data-driven dialogue act classifier that is learned ...
Kristy Elizabeth Boyer, Eun Y. Ha, Robert Phillips...
DISOPT
2011
210views Education» more  DISOPT 2011»
13 years 3 months ago
The parameterized complexity of k-flip local search for SAT and MAX SAT
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
Stefan Szeider