Sciweavers

69 search results - page 2 / 14
» Nonmonotonic Commitment Machines
Sort
View
ICML
2009
IEEE
13 years 11 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
ATAL
2009
Springer
13 years 11 months ago
Reasoning intra-dependency in commitments for robust scheduling
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
Mingzhong Wang, Kotagiri Ramamohanarao, Jinjun Che...
CORR
2002
Springer
99views Education» more  CORR 2002»
13 years 4 months ago
Nonmonotonic inference operations
A. Tarski 21] proposed the study of in nitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations...
Michael Freund, Daniel J. Lehmann
MP
2006
137views more  MP 2006»
13 years 4 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
IAT
2006
IEEE
13 years 10 months ago
Designing Commitment-Based Agent Interactions
A key property of agents is that they are social, and hence the design of agent interactions is a crucial part of an agentoriented software engineering methodology. Agent interact...
Michael Winikoff