Sciweavers

1698 search results - page 134 / 340
» Growing Complex Games
Sort
View
SIGCSE
2005
ACM
180views Education» more  SIGCSE 2005»
15 years 9 months ago
Analyze that: puzzles and analysis of algorithms
The paper advocates a wider use of puzzles and puzzle-like games in teaching the analysis of algorithms. It discusses many specific examples—from classic puzzles of recreational...
Anany Levitin
145
Voted
FSTTCS
2005
Springer
15 years 9 months ago
Fixpoint Logics on Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Stefan Göller, Markus Lohrey
QOFIS
2004
Springer
15 years 9 months ago
Multi-bid Versus Progressive Second Price Auctions in a Stochastic Environment
Pricing is considered a relevant way to control congestion and differentiate services in communication networks. Among all pricing schemes, auctioning for bandwidth has received a...
Patrick Maillé, Bruno Tuffin
HICSS
2000
IEEE
112views Biometrics» more  HICSS 2000»
15 years 8 months ago
Trust is Much More Than Subjective Probability: Mental Components and Sources of Trust
In this paper we claim the importance of a cognitive view of trust (its articulate, analytic and founded view), in contrast with a mere quantitative and opaque view of trust suppo...
Cristiano Castelfranchi, Rino Falcone
LICS
2000
IEEE
15 years 8 months ago
The Role of Decidability in First Order Separations over Classes of Finite Structures
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
Steven Lindell, Scott Weinstein