Sciweavers

20638 search results - page 3858 / 4128
» Network Computing
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICANN
2009
Springer
16 years 1 months ago
Multimodal Sparse Features for Object Detection
In this paper the sparse coding principle is employed for the representation of multimodal image data, i.e. image intensity and range. We estimate an image basis for frontal face i...
Martin Haker, Thomas Martinetz, Erhardt Barth
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
16 years 1 months ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
ISCIS
2009
Springer
16 years 1 months ago
A web-based data source for metabolomics
—With the development of improved and cost-effective technologies, it is now possible to detect thousands of metabolites in biofluids or specific organs, and reliably quantify th...
Ali Cakmak, Arun Dsouza, Richard Hanson, Gultekin ...
ISNN
2009
Springer
16 years 1 months ago
An Improved Quantum Evolutionary Algorithm with 2-Crossovers
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
Zhihui Xing, Haibin Duan, Chunfang Xu
« Prev « First page 3858 / 4128 Last » Next »