Sciweavers

1795 search results - page 353 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
AI
2008
Springer
13 years 8 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
Protein binding hot spots and the residue-residue pairing preference: a water exclusion perspective
Background: A protein binding hot spot is a small cluster of residues tightly packed at the center of the interface between two interacting proteins. Though a hot spot constitutes...
Qian Liu, Jinyan Li
JANCL
2008
109views more  JANCL 2008»
13 years 8 months ago
Conditionalization and total knowledge
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
Ian Pratt-Hartmann
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 8 months ago
Optimal Throughput-Diversity-Delay Tradeoff in MIMO ARQ Block-Fading Channels
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...
Allen Chuang, Albert Guillen i Fabregas, Lars K. R...
EAAI
2007
154views more  EAAI 2007»
13 years 8 months ago
An agent-based approach to solve dynamic meeting scheduling problems with preferences
Multi-agent systems are widely used to address large-scale distributed combinatorial applications in the real world. One such application is meeting scheduling (MS), which is deļ¬...
Ahlem Ben Hassine, Tu Bao Ho