Sciweavers

4403 search results - page 311 / 881
» Galois Theory of Algorithms
Sort
View
ICDT
2010
ACM
125views Database» more  ICDT 2010»
15 years 10 months ago
Synthesizing View Definitions from Data
Given a database instance and a corresponding view instance, we address the view definitions problem (VDP): Find the most succinct and accurate view definition, when the view quer...
Anish Das Sarma, Aditya Parameswaran, Hector Garci...
ATAL
2006
Springer
15 years 10 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
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
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 10 months ago
How randomized search heuristics find maximum cliques in planar graphs
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
Tobias Storch
ATAL
2010
Springer
15 years 7 months ago
Parameterizing the winner determination problem for combinatorial auctions
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
David Loker, Kate Larson