Sciweavers

500 search results - page 58 / 100
» Improving Search in Peer-to-Peer Networks
Sort
View
NETWORKS
2008
14 years 11 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani
GLOBECOM
2009
IEEE
15 years 6 months ago
Graph-Based Approach for Enhancing Capacity and Fairness in Wireless Mesh Networks
—Wireless Mesh Networks have been an emerging technology in the past years. They are mainly used for providing last-mile broadband wireless access. It is then highly recommended ...
Salim Nahle, Naceur Malouch
DASFAA
2007
IEEE
191views Database» more  DASFAA 2007»
15 years 3 months ago
ABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks
In mobile ad-hoc peer-to-peer (M-P2P) networks, a large percentage of the mobile peers typically do not provide any service to the network, thereby motivating incentive schemes for...
Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsur...
ICMLA
2007
15 years 1 months ago
Learning bayesian networks consistent with the optimal branching
We introduce a polynomial-time algorithm to learn Bayesian networks whose structure is restricted to nodes with in-degree at most k and to edges consistent with the optimal branch...
Alexandra M. Carvalho, Arlindo L. Oliveira
UAI
1993
15 years 1 months ago
Using Causal Information and Local Measures to Learn Bayesian Networks
In previous work we developed a method of learning Bayesian Network models from raw data. This method relies on the well known minimal description length (MDL) principle. The MDL ...
Wai Lam, Fahiem Bacchus