1512 search results - page 92 / 303 » When Suboptimal Rules |
PEPM
2007
ACM
14 years 4 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
CADE
2006
Springer
14 years 10 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
ACRI
2008
Springer
14 years 4 months ago
2008
Springer
This article studies the convergence properties of some 2D cellular automata, when a single cell is updated at random at each time step. We tackle this question for a particular s...
ESWS
2004
Springer
14 years 3 months ago
2004
Springer
Ontology mapping is important when working with more than one ontology. Typically similarity considerations are the basis for this. In this paper an approach to integrate various s...