Sciweavers

363 search results - page 5 / 73
» About paths with two blocks
Sort
View
CLIMA
2007
13 years 11 months ago
A Logic for Reasoning about Rational Agents
We propose a new version of ATLP (“ATL with plausibility”), a logic for reasoning about the outcome of rational play in game-like scenarios. Unlike in [8], where two different ...
Wojciech Jamroga, Nils Bulling
STACS
2000
Springer
14 years 1 months ago
On the Many Faces of Block Codes
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta...
USITS
2003
13 years 11 months ago
Why Do Internet Services Fail, and What Can Be Done About It?
In 1986 Jim Gray published his landmark study of the causes of failures of Tandem systems and the techniques Tandem used to prevent such failures [6]. Seventeen years later, Inter...
David L. Oppenheimer, Archana Ganapathi, David A. ...
JCT
2007
97views more  JCT 2007»
13 years 9 months ago
What power of two divides a weighted Catalan number?
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
Alexander Postnikov, Bruce E. Sagan
ACMICEC
2003
ACM
87views ECommerce» more  ACMICEC 2003»
14 years 3 months ago
A comparison of two algorithms for multi-unit k-double auctions
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
Shengli Bao, Peter R. Wurman