5331 search results - page 424 / 1067 » Algebraic Methods for Optimization Problems |
168
click to vote
SPAA
2006
ACM
16 years 23 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
167
click to vote
FECS
2006
15 years 8 months ago
2006
- In contrast to most of the senior level Artificial Intelligence (AI) courses where AI is taught in the jargon of theoretical computer science with crowd of complex matrix algebra...
155
click to vote
LCPC
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during par...
195
click to vote
IADIS
2008
15 years 8 months ago
2008
Multi agent learning systems pose an interesting set of problems: in large environments agents may develop localised behaviour patterns that are not necessarily optimal; in a pure...
189
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...