Sciweavers

83 search results - page 7 / 17
» Shortest Path Discovery Problems: A Framework, Algorithms an...
Sort
View
TMC
2008
192views more  TMC 2008»
13 years 7 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 5 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
ESA
2009
Springer
190views Algorithms» more  ESA 2009»
14 years 2 months ago
Accelerating Multi-modal Route Planning by Access-Nodes
Recent research on fast route planning algorithms focused either on road networks or on public transportation. However, on the long run, we are interested in planning routes in a m...
Daniel Delling, Thomas Pajor, Dorothea Wagner
CEC
2007
IEEE
13 years 11 months ago
Evolution of classification rules for comprehensible knowledge discovery
This article, which lies within the data mining framework, proposes a method to build classifiers based on the evolution of rules. The method, named REC (Rule Evolution for Classif...
Emiliano Carreno, Guillermo Leguizamón, Nea...
SSD
2007
Springer
132views Database» more  SSD 2007»
14 years 1 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...