Sciweavers

3706 search results - page 698 / 742
» System Description: E-KRHyper
Sort
View
CORR
2006
Springer
141views Education» more  CORR 2006»
13 years 7 months ago
Ideas by Statistical Mechanics (ISM)
Ideas by Statistical Mechanics (ISM) is a generic program to model evolution and propagation of ideas/patterns throughout populations subjected to endogenous and exogenous interac...
Lester Ingber
ENTCS
2006
1305views more  ENTCS 2006»
13 years 7 months ago
Communication Attitudes: A Formal Approach to Ostensible Intentions, and Individual and Group Opinions
Conventional approaches to the modeling of autonomous agents and agent communication rely heavily on the ascription of mental properties like beliefs and intentions to the individ...
Matthias Nickles, Felix A. Fischer, Gerhard Wei&sz...
BMCBI
2007
200views more  BMCBI 2007»
13 years 7 months ago
BNDB - The Biochemical Network Database
Background: Technological advances in high-throughput techniques and efficient data acquisition methods have resulted in a massive amount of life science data. The data is stored ...
Jan Küntzer, Christina Backes, Torsten Blum, ...
IJIIDS
2008
201views more  IJIIDS 2008»
13 years 7 months ago
MALEF: Framework for distributed machine learning and data mining
: Growing importance of distributed data mining techniques has recently attracted attention of researchers in multiagent domain. Several agent-based application have been already c...
Jan Tozicka, Michael Rovatsos, Michal Pechoucek, S...
CC
2007
Springer
121views System Software» more  CC 2007»
13 years 7 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma