1802 search results - page 39 / 361 » Complexity Theory for Operators in Analysis |
151
click to vote
CIKM
1997
Springer
15 years 9 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
150
click to vote
ATAL
2006
Springer
15 years 8 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
180
Voted
AISC
2010
Springer
15 years 7 months ago
2010
Springer
A lot of mathematical knowledge has been formalized and stored in repositories by now: Different mathematical theorems and theories have been taken into consideration and included ...
149
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
145
click to vote
CW
2002
IEEE
15 years 10 months ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...