4218 search results - page 395 / 844 » Complete sets of cooperations |
233
click to vote
IJNSEC
2007
15 years 7 months ago
2007
In order to maximize resource utilization as well as providing trust management in P2P computing environments, we propose a novel framework - Trust-Incentive Service Management (T...
213
click to vote
TCAD
2008
15 years 7 months ago
2008
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
223
click to vote
TOPNOC
2008
15 years 7 months ago
2008
Message Sequence Charts (MSCs) are a well known language for specifying scenarios that describe how different actors (e.g., system components, people, or organizations) interact. M...
187
click to vote
TPLP
2008
15 years 7 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
200
click to vote
CPC
2004
15 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...