Sciweavers

1948 search results - page 225 / 390
» Formalizing Mirror Theory
Sort
View
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
16 years 17 days ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
SIGECOM
2005
ACM
130views ECommerce» more  SIGECOM 2005»
16 years 5 days ago
Graceful service degradation (or, how to know your payment is late)
When distributing digital content over a broadcast channel it’s often necessary to revoke users whose access privileges have expired, thus preventing them from recovering the co...
Alexandr Andoni, Jessica Staddon
CAV
2005
Springer
104views Hardware» more  CAV 2005»
16 years 4 days ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
CICLING
2005
Springer
16 years 4 days ago
A Computational Model of the Spanish Clitic System
In this paper a computational model of the Spanish clitic system is presented. In this model clitic pronouns receive a dual analysis in which enclitics are considered inflexions wh...
Luis Alberto Pineda, Ivan V. Meza
DALT
2005
Springer
16 years 4 days ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki