Sciweavers

1282 search results - page 105 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
CONTEXT
2003
Springer
15 years 7 months ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
15 years 8 months ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...
BIRTHDAY
2010
Springer
15 years 7 months ago
Indexing and Searching a Mass Spectrometry Database
Abstract. Database preprocessing in order to create an index often permits considerable speedup in search compared to the iterated query of an unprocessed database. In this paper w...
Søren Besenbacher, Benno Schwikowski, Jens ...
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 9 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall
JSAC
2006
96views more  JSAC 2006»
15 years 2 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank