Sciweavers

4781 search results - page 303 / 957
» Complexity at large
Sort
View
AGENTS
1999
Springer
15 years 8 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
BMCBI
2011
14 years 11 months ago
ASPDock: protein-protein docking algorithm using atomic solvation parameters model
Background: Atomic Solvation Parameters (ASP) model has been proven to be a very successful method of calculating the binding free energy of protein complexes. This suggests that ...
Lin Li, Dachuan Guo, Yangyu Huang, Shiyong Liu, Yi...
TKDE
2008
125views more  TKDE 2008»
15 years 4 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
ASPDAC
2005
ACM
113views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Scalable interprocedural register allocation for high level synthesis
Abstract— The success of classical high level synthesis has been limited by the complexity of the applications it can handle, typically not large enough to necessitate the depart...
Rami Beidas, Jianwen Zhu
ACSC
2008
IEEE
15 years 10 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen