Sciweavers

1930 search results - page 276 / 386
» Epistemic comparative conditionals
Sort
View
IJCAI
1989
13 years 11 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
WCE
2007
13 years 11 months ago
Beyond Web Intermediaries: A Framework for Securing Digital Content on Client Systems
—The move to begin to place liabilities for copyright violations on internet intermediaries such as ISPs and Cyber Cafes as a result of contents allowed through their networks is...
Stella C. Chiemeke, Olumide B. Longe
AIPS
2009
13 years 11 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
ATAL
2010
Springer
13 years 11 months ago
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
We present the logic CTL.STIT, which is the join of the logic CTL with a multi-agent strategic stit-logic variant. CTL.STIT subsumes ATL, and adds expressivity to it that we claim...
Jan Broersen
CCGRID
2010
IEEE
13 years 11 months ago
A Fair Decentralized Scheduler for Bag-of-Tasks Applications on Desktop Grids
Desktop Grids have become very popular nowadays, with projects that include hundred of thousands computers. Desktop grid scheduling faces two challenges. First, the platform is vo...
Javier Celaya, Loris Marchal