Sciweavers

1272 search results - page 170 / 255
» The Set Cover with Pairs Problem
Sort
View
TON
2008
120views more  TON 2008»
13 years 9 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt
ICTAI
2009
IEEE
13 years 8 months ago
Merging Qualitative Constraint Networks in a Piecewise Fashion
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
Jean-François Condotta, Souhila Kaci, Pierr...
AAAI
2011
12 years 10 months ago
Trajectory Regression on Road Networks
This paper addresses the task of trajectory cost prediction, a new learning task for trajectories. The goal of this task is to predict the cost for an arbitrary (possibly unknown)...
Tsuyoshi Idé, Masashi Sugiyama
JCSS
2008
138views more  JCSS 2008»
13 years 10 months ago
Reducing mechanism design to algorithm design via machine learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
ESWS
2009
Springer
14 years 5 months ago
Evolva: A Comprehensive Approach to Ontology Evolution
Ontology evolution is increasingly gaining momentum in the area of Semantic Web research. Current approaches target the evolution in terms of either content, or change management, ...
Fouad Zablith