Sciweavers

2569 search results - page 241 / 514
» Approximate Objects and Approximate Theories
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Decentralised dynamic task allocation: a practical game: theoretic approach
This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a Markov game formulation of these pr...
Archie C. Chapman, Rosa Anna Micillo, Ramachandra ...
GECCO
2007
Springer
190views Optimization» more  GECCO 2007»
16 years 23 days ago
Analysis of evolutionary algorithms for the longest common subsequence problem
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
Thomas Jansen, Dennis Weyland
INFOCOM
2006
IEEE
16 years 19 days ago
A Statistical Framework for Intrusion Detection in Ad Hoc Networks
— We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically fail to detect attacks and also gener...
Dhanant Subhadrabandhu, Saswati Sarkar, Farooq Anj...
DIALM
2004
ACM
113views Algorithms» more  DIALM 2004»
16 years 1 days ago
Gathering correlated data in sensor networks
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
Pascal von Rickenbach, Roger Wattenhofer
DSMML
2004
Springer
16 years 7 hour ago
Can Gaussian Process Regression Be Made Robust Against Model Mismatch?
Learning curves for Gaussian process (GP) regression can be strongly affected by a mismatch between the ‘student’ model and the ‘teacher’ (true data generation process), e...
Peter Sollich