3250 search results - page 101 / 650 » Parameterized Learning Complexity |
126
click to vote
COMPLEXITY
2008
15 years 6 months ago
2008
Results are presented of a simulation which mimics an evolutionary learning process for small networks. Special features of these networks include a high recurrency, a transition ...
170
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
This paper presents a new surface content completion framework that can restore both shape and appearance from scanned, incomplete point set inputs. First, the geometric holes can...
144
click to vote
CAV
2007
Springer
16 years 14 days ago
2007
Springer
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
169
click to vote
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
197
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...