Sciweavers

1662 search results - page 50 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
AAAI
1994
13 years 10 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
ICIP
2000
IEEE
14 years 10 months ago
Complexity-Regularized Denoising of Poisson-Corrupted Data
In this paper, we apply the complexity?regularization principle to Poisson imaging. We formulate a natural distortion measure in image space, and present a connection between comp...
Juan Liu, Pierre Moulin
ATAL
2005
Springer
14 years 2 months ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge
AAAI
2000
13 years 10 months ago
Applying Learnable Evolution Model to Heat Exchanger Design
A new approach to evolutionary computation, called Learnable Evolution Model (LEM), has been applied to the problem of optimizing tube structures of heat exchangers. In contrast t...
Kenneth A. Kaufman, Ryszard S. Michalski