Sciweavers

464 search results - page 62 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 2 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
KDD
2009
ACM
305views Data Mining» more  KDD 2009»
16 years 12 days ago
Grocery shopping recommendations based on basket-sensitive random walk
We describe a recommender system in the domain of grocery shopping. While recommender systems have been widely studied, this is mostly in relation to leisure products (e.g. movies...
Ming Li, M. Benjamin Dias, Ian H. Jarman, Wael El-...
AAAI
2010
15 years 1 months ago
Coalition Structure Generation based on Distributed Constraint Optimization
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
Suguru Ueda, Atsushi Iwasaki, Makoto Yokoo, Marius...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
15 years 1 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
15 years 8 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng