4903 search results - page 910 / 981 » The Set Covering Machine |
ICDT
2001
ACM
14 years 9 days ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
NEUROSCIENCE
2001
Springer
14 years 8 days ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
WIA
2001
Springer
14 years 8 days ago
2001
Springer
A formal device is said to be adaptive whenever its behavior changes dynamically, in a direct response to its input stimuli, without interference of external agents, even its user...
STOC
2000
ACM
14 years 6 days ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
AGENTS
2000
Springer
14 years 6 days ago
2000
Springer
Adaptivity, both of the individual agents and of the interaction structure among the agents, seems indispensable for scaling up multi-agent systems MAS's in noisy environme...