Sciweavers

4816 search results - page 369 / 964
» Performance analysis of the AntNet algorithm
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
16 years 9 days ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
WEBI
2005
Springer
16 years 7 days ago
WICER: A Weighted Inter-Cluster Edge Ranking for Clustered Graphs
Several algorithms based on link analysis have been developed to measure the importance of nodes on a graph such as pages on the World Wide Web. PageRank and HITS are the most pop...
Divya Padmanabhan, Prasanna Kumar Desikan, Jaideep...
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
16 years 4 days ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
ICNP
2002
IEEE
15 years 11 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
ICML
2006
IEEE
16 years 7 months ago
Bayesian regression with input noise for high dimensional data
This paper examines high dimensional regression with noise-contaminated input and output data. Goals of such learning problems include optimal prediction with noiseless query poin...
Jo-Anne Ting, Aaron D'Souza, Stefan Schaal