Sciweavers

4435 search results - page 324 / 887
» Algorithms, games, and the internet
Sort
View
NIPS
2004
15 years 8 months ago
Convergence and No-Regret in Multiagent Learning
Learning in a multiagent system is a challenging problem due to two key factors. First, if other agents are simultaneously learning then the environment is no longer stationary, t...
Michael H. Bowling
198
Voted
SOFSEM
2012
Springer
14 years 2 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
160
Voted
WWW
2008
ACM
16 years 7 months ago
Finding core members in virtual communities
Finding the core members of a virtual community is an important problem in community analysis. Here we presented an simulated annealing algorithm to solve this problem by optimizi...
Haiqiang Chen, Xueqi Cheng, Yue Liu
WWW
2008
ACM
16 years 7 months ago
Efficient mining of frequent sequence generators
Sequential pattern mining has raised great interest in data mining research field in recent years. However, to our best knowledge, no existing work studies the problem of frequent...
Chuancong Gao, Jianyong Wang, Yukai He, Lizhu Zhou
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
16 years 7 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...