Sciweavers

2925 search results - page 321 / 585
» Information Complexity of Online Problems
Sort
View
WAIM
2007
Springer
16 years 23 days ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
ENC
2003
IEEE
15 years 12 months ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
GECCO
2006
Springer
153views Optimization» more  GECCO 2006»
15 years 10 months ago
Analysis of the difficulty of learning goal-scoring behaviour for robot soccer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
Jeff Riley, Victor Ciesielski
INFOCOM
1995
IEEE
15 years 10 months ago
Automatic Alarm Correlation for Fault Identification
In communication networks, a large number of alarms exist to signal any abnormal behavior of the network. As network faults typically result in a number of alarms, correlating the...
Isabelle Rouvellou, George W. Hart
ECAI
2010
Springer
15 years 7 months ago
Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
We study the problem of fairly dividing a set of goods amongst a group of agents, when those agents have preferences that are ordinal relations over alternative bundles of goods (r...
Sylvain Bouveret, Ulle Endriss, Jérôm...