Sciweavers

14386 search results - page 268 / 2878
» The Chinese Generals Problem
Sort
View
FCT
2007
Springer
15 years 11 months ago
A Novel Information Transmission Problem and Its Optimal Solution
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
Eric Bach, Jin-yi Cai
148
Voted
FROCOS
2007
Springer
15 years 11 months ago
Noetherianity and Combination Problems
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 11 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
ICA
2007
Springer
15 years 11 months ago
Solving the Permutation Problem in Convolutive Blind Source Separation
Abstract. This paper presents a new algorithm for solving the permutation ambiguity in convolutive blind source separation. When transformed to the frequency domain, the source sep...
Radoslaw Mazur, Alfred Mertins
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
15 years 11 months ago
A Sub-cubic Time Algorithm for the k -Maximum Subarray Problem
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
Sung Eun Bae, Tadao Takaoka