3946 search results - page 345 / 790 » The computational complexity of choice sets |
164
click to vote
ACMACE
2009
ACM
15 years 10 months ago
2009
ACM
The Zuzen framework is an intelligent tool set for assisting in the generation of machinima. With Zuzen, users that are novice cinematographers do not need to use complex movie-ma...
161
click to vote
AAAI
2007
15 years 9 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
200
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
194
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, Border algorithm...
173
click to vote
AMAI
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...