Sciweavers

419 search results - page 40 / 84
» Succincter
Sort
View
CACM
2006
95views more  CACM 2006»
15 years 25 days ago
Computational thinking
ional thinking is using abstraction and decomposition when attacking a large complex task or designing a large complex system. It is separation of concerns. It is choosing an appro...
Jeannette M. Wing
85
Voted
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 24 days ago
Knowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of know...
Emina Torlak, Marten van Dijk, Blaise Gassend, Dan...
110
Voted
ENTCS
2006
142views more  ENTCS 2006»
15 years 24 days ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
JAIR
2008
145views more  JAIR 2008»
15 years 23 days ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
85
Voted
DMTCS
2007
73views Mathematics» more  DMTCS 2007»
15 years 22 days ago
"Trivializing" Generalizations of some Izergin-Korepin-type Determinants
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of ...
Tewodros Amdeberhan, Doron Zeilberger