Sciweavers

845 search results - page 169 / 169
» Connecting Many-Sorted Theories
Sort
View
MICRO
2006
IEEE
159views Hardware» more  MICRO 2006»
13 years 4 months ago
MRF Reinforcer: A Probabilistic Element for Space Redundancy in Nanoscale Circuits
Shrinking devices to the nanoscale, increasing integration densities, and reducing of voltage levels down to the thermal limit, all conspire to produce faulty systems. Frequent oc...
Kundan Nepal, R. Iris Bahar, Joseph L. Mundy, Will...
AAMAS
2005
Springer
13 years 4 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke
BMCBI
2005
120views more  BMCBI 2005»
13 years 4 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
MOBIHOC
2008
ACM
14 years 4 months ago
Multicast capacity for hybrid wireless networks
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
XuFei Mao, Xiang-Yang Li, ShaoJie Tang
DIMACS
1996
13 years 6 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin