Sciweavers

17760 search results - page 292 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
16 years 27 days ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
ICALP
2007
Springer
16 years 27 days ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
ISAAC
2007
Springer
109views Algorithms» more  ISAAC 2007»
16 years 26 days 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
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
16 years 25 days ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
ISCC
2006
IEEE
16 years 22 days ago
Performance Evaluation of a Basic OFDMA Scheduling Algorithm for Packet Data Transmissions
Currently, the OFDMA transmission scheme seems to be a promising candidate for future broadband radio systems. The crucial part which determines the performance is thereby the com...
Michael Einhaus, Ole Klein