Sciweavers

2314 search results - page 84 / 463
» Monoids over domains
Sort
View
ATAL
2003
Springer
15 years 5 months ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
AAAI
2006
15 years 1 months ago
Learning Partially Observable Action Models: Efficient Algorithms
We present tractable, exact algorithms for learning actions' effects and preconditions in partially observable domains. Our algorithms maintain a propositional logical repres...
Dafna Shahaf, Allen Chang, Eyal Amir
MASCOTS
2004
15 years 1 months ago
Engineering Mobile Wireless Publish/Subscribe Systems for High Performance
Decoupling flexible, scalable and asynchronous nature of publish/subscribe systems makes them a good choice for the mobile wireless domain. Our research investigates the applicati...
Umar Farooq, Shikharesh Majumdar, Eric W. Parsons
FUIN
2008
89views more  FUIN 2008»
14 years 12 months ago
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [16] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose ...
Wan Fokkink, Jun Pang, Anton Wijs
ENTCS
2006
153views more  ENTCS 2006»
14 years 12 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...