Sciweavers

1151 search results - page 110 / 231
» Modelling Digital Circuits Problems with Set Constraints
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 4 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
IJCSA
2007
88views more  IJCSA 2007»
13 years 10 months ago
A New Quantitative Trust Model for Negotiating Agents using Argumentation
In this paper, we propose a new quantitative trust model for argumentation-based negotiating agents. The purpose of such a model is to provide a secure environment for agent negot...
Jamal Bentahar, John-Jules Ch. Meyer
VLSID
2003
IEEE
134views VLSI» more  VLSID 2003»
14 years 10 months ago
A Framework for Energy and Transient Power Reduction during Behavioral Synthesis
Abstract-- In battery driven portable applications, the minimization of energy, average power, peak power, and peak power differential are equally important to improve reliability ...
Saraju P. Mohanty, N. Ranganathan
STACS
1997
Springer
14 years 2 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
AAAI
2008
14 years 16 days ago
Computing Observation Vectors for Max-Fault Min-Cardinality Diagnoses
Model-Based Diagnosis (MBD) typically focuses on diagnoses, minimal under some minimality criterion, e.g., the minimal-cardinality set of faulty components that explain an observa...
Alexander Feldman, Gregory M. Provan, Arjan J. C. ...