3946 search results - page 541 / 790 » The computational complexity of choice sets |
178
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
164
click to vote
SIAMSC
2010
15 years 5 months ago
2010
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
196
click to vote
CODES
2010
IEEE
15 years 4 months ago
2010
IEEE
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
295
click to vote
PAMI
2011
15 years 1 months ago
2011
— The accurate detection of object boundaries via active contours is an ongoing research topic in computer vision. Most active contours converge towards some desired contour by m...
170
click to vote
COGSR
2011
15 years 1 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...