804 search results - page 41 / 161 » Solutions to Computational Problems Through Gene Assembly |
132
click to vote
SAC
2011
ACM
14 years 3 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
100
Voted
DEXAW
1998
IEEE
15 years 5 months ago
1998
IEEE
A mechanistic view of software component assembly implies exact matching and fitting of the particular components. We argue that components for large-scale software construction s...
WLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Combinatorial Auctions are an attractive application of intelligent agents; their applications are countless and are shown to provide good revenues. On the other hand, on...
125
click to vote
PAMI
2010
14 years 11 months ago
2010
—A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual lea...
106
Voted
JWSR
2007
15 years 17 days ago
2007
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...