Sciweavers

9405 search results - page 199 / 1881
» Computing a Model of Set Theory
Sort
View
144
Voted
CP
2003
Springer
15 years 8 months ago
Incremental Computation of Resource-Envelopes in Producer-Consumer Models
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
T. K. Satish Kumar
ATAL
2005
Springer
15 years 9 months ago
A negotiation model for autonomous agents: key features and comparison with existing models
This paper presents the key features of a new negotiation model for autonomous agents. The model is generic, handles multi-party and multi-issue negotiation, acknowledges the role...
Fernando Lopes, Augusto Q. Novais, Nuno J. Mamede,...
172
Voted
TIFS
2008
157views more  TIFS 2008»
15 years 3 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
151
Voted
ATAL
2010
Springer
15 years 4 months ago
Preference elicitation for risky prospects
Minimax-regret preference elicitation allows intelligent decisions to be made on behalf of people facing risky choices. Standard gamble queries, a vital tool in this type of prefe...
Greg Hines, Kate Larson
136
Voted
ENTCS
2002
112views more  ENTCS 2002»
15 years 3 months ago
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
The Ambient Calculus has been recently proposed as a model of mobility of agents in a dynamically changing hierarchy of domains. In this paper, we describe the implementation of t...
Ivan Scagnetto, Marino Miculan