9842 search results - page 203 / 1969 » The Complexity of the Matching-Cut Problem |
89
Voted
AAAI
2008
15 years 2 months ago
2008
This paper addresses the problem of plan recognition for multi-agent teams. Complex multi-agent tasks typically require dynamic teams where the team membership changes over time. ...
104
Voted
NIPS
2007
15 years 2 months ago
2007
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
77
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
75
Voted
WSC
2004
15 years 1 months ago
2004
Computer-based business analysis relies on models, or algorithmic representations of the business process. Real-life business problems can become very complex, which creates diffi...
139
click to vote
ALT
2011
Springer
14 years 17 days ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...