2542 search results - page 440 / 509 » Computing Cartograms with Optimal Complexity |
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Nowadays, large distributed databases are commonplace. Client applications increasingly rely on accessing objects from multiple remote hosts. The Internet itself is a huge network ...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
ISMIR
2004
Springer
14 years 2 months ago
2004
Springer
Time series representations are common in MIR applications such as query-by-humming, where a sung query might be represented by a series of ‘notes’ for database retrieval. Whi...
CEC
2003
IEEE
14 years 2 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...