950 search results - page 25 / 190 » Modified global k |
ECEASST
2010
13 years 7 months ago
2010
This short paper explores the potential of embedding-based graph rewriting as a tool for understanding natural computing, and in particular self-assembly. The basic point of view i...
CAL
2004
13 years 10 months ago
2004
We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most...
ESA
2008
Springer
14 years 4 days ago
2008
Springer
Abstract. The 3D visibility skeleton is a data structure used to encode global visibility information about a set of objects. Previous theoretical results have shown that for k con...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
UAI
1994
13 years 11 months ago
1994
In this paper we propose a new approach to probabilistic inference on belief networks, global conditioning, which is a simple generalization of Pearl's (1986b) method of loop...