14739 search results - page 2899 / 2948 » An optimization problem on the sphere |
AAAI
2010
14 years 11 months ago
2010
We consider approval voting elections in which each voter votes for a (possibly empty) set of candidates and the outcome consists of a set of k candidates for some parameter k, e....
AAAI
2010
14 years 11 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
BCS
2008
14 years 11 months ago
2008
Programs are fragile for many reasons, including software errors, partial failures, and network problems. One way to make software more robust is to design it from the start as a ...
ICWN
2008
14 years 11 months ago
2008
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
ICONIP
2007
14 years 11 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...