Sciweavers

16188 search results - page 2544 / 3238
» The Optimal PAC Algorithm
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 5 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
180
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
Overcoming Failures: Fault-tolerance and Logical Centralization in Clean-Slate Network Management
—We investigate the design of a clean-slate control and nt plane for data networks using the abstraction of 4D architecture, utilizing and extending 4D’s concept of logically c...
Hammad Iqbal, Taieb Znati
206
Voted
MFCS
2010
Springer
15 years 5 months ago
Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
Gero Greiner, Riko Jacob
170
Voted
PCM
2010
Springer
204views Multimedia» more  PCM 2010»
15 years 5 months ago
Learning Contextual Metrics for Automatic Image Annotation
Abstract. The semantic contextual information is shown to be an important resource for improving the scene and image recognition, but is seldom explored in the literature of previo...
Zuotao Liu, Xiangdong Zhou, Yu Xiang, Yan-Tao Zhen...
205
Voted
PPSN
2010
Springer
15 years 5 months ago
An Analysis of the XOR Dynamic Problem Generator Based on the Dynamical System
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...
Renato Tinós, Shengxiang Yang
« Prev « First page 2544 / 3238 Last » Next »