Sciweavers

749 search results - page 43 / 150
» Combinatory Models and Symbolic Computation
Sort
View
APN
2010
Springer
14 years 2 months ago
Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
Thomas Chatain, Eric Fabre
STOC
2009
ACM
112views Algorithms» more  STOC 2009»
14 years 10 months ago
A new approach to auctions and resilient mechanism design
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing significant revenue in unrestricted combinatorial auctions. Our mechanism ? su...
Jing Chen, Silvio Micali
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
14 years 2 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
JCM
2008
104views more  JCM 2008»
13 years 10 months ago
An OFDM Symbol Design for Reduced Complexity MMSE Channel Estimation
In this paper we revisit the minimum mean square error (MMSE) pilot-aided channel estimation for broadband orthogonal frequency division multiplexing (OFDM) systems. The careful de...
Carlos Ribeiro, Atílio Gameiro
DAS
2008
Springer
13 years 11 months ago
An Empirical Measure on the Set of Symbols Occurring in Engineering Mathematics Texts
Certain forms of mathematical expression are used more often than others in practice. A quantitative understanding of actual usage can provide additional information to improve th...
Stephen M. Watt