Sciweavers

5995 search results - page 1116 / 1199
» Algorithmic Game Theory
Sort
View
KDD
2010
ACM
235views Data Mining» more  KDD 2010»
15 years 5 months ago
New perspectives and methods in link prediction
This paper examines important factors for link prediction in networks and provides a general, high-performance framework for the prediction task. Link prediction in sparse network...
Ryan Lichtenwalter, Jake T. Lussier, Nitesh V. Cha...
EMSOFT
2009
Springer
15 years 5 months ago
Modular static scheduling of synchronous data-flow networks: an efficient symbolic representation
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
Marc Pouzet, Pascal Raymond
ATAL
2006
Springer
15 years 5 months ago
Integrating parallel interactions into cooperative search
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...
Efrat Manisterski, David Sarne, Sarit Kraus
105
Voted
CCS
2006
ACM
15 years 5 months ago
Beyond separation of duty: an algebra for specifying high-level security policies
A high-level security policy states an overall requirement for a sensitive task. One example of a high-level security policy is a separation of duty policy, which requires a sensi...
Ninghui Li, Qihua Wang
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 5 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
« Prev « First page 1116 / 1199 Last » Next »