Sciweavers

547 search results - page 88 / 110
» Preference-Based Search for Scheduling
Sort
View
IWCLS
2007
Springer
14 years 4 months ago
On Lookahead and Latent Learning in Simple LCS
Learning Classifier Systems use evolutionary algorithms to facilitate rule- discovery, where rule fitness is traditionally payoff based and assigned under a sharing scheme. Most c...
Larry Bull
KCAP
2005
ACM
14 years 3 months ago
Knowledge base reuse through constraint relaxation
Effective reuse of Knowledge Bases (KBs) often entails the expensive task of identifying plausible KB-PS (Problem Solver) combinations. We propose a novel technique based on Const...
Tomas Eric Nordlander, Derek H. Sleeman, Ken N. Br...
ICCS
2004
Springer
14 years 3 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...
ICDE
2000
IEEE
110views Database» more  ICDE 2000»
14 years 2 months ago
Optimal Index and Data Allocation in Multiple Broadcast Channels
The issue of data broadcast has received much attention in mobile computing. A periodic broadcast of frequently requested data can reduce the workload of the up-link channel and f...
Shou-Chih Lo, Arbee L. P. Chen
ASIACRYPT
1999
Springer
14 years 2 months ago
Equivalent Keys of HPC
This paper presents a weakness in the key schedule of the AES candidate HPC (Hasty Pudding Cipher). It is shown that for the HPC version with a 128-bit key, 1 in 256 keys is weak i...
Carl D'Halluin, Gert Bijnens, Bart Preneel, Vincen...