Sciweavers

2687 search results - page 533 / 538
» Formal Analysis of PKCS
Sort
View
JSYML
2007
100views more  JSYML 2007»
13 years 10 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
AI
2002
Springer
13 years 10 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
BMCBI
2004
208views more  BMCBI 2004»
13 years 10 months ago
Using 3D Hidden Markov Models that explicitly represent spatial coordinates to model and compare protein structures
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
Vadim Alexandrov, Mark Gerstein
CMOT
2004
83views more  CMOT 2004»
13 years 10 months ago
Networks, Fields and Organizations: Micro-Dynamics, Scale and Cohesive Embeddings
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social netwo...
Douglas R. White, Jason Owen-Smith, James Moody, W...
CORR
2002
Springer
131views Education» more  CORR 2002»
13 years 10 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann