1477 search results - page 57 / 296 » Complexity of (iterated) dominance |
127
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. Such an analysis calls for the use of transfinite iterations of the correspond...
152
click to vote
ASAP
2007
IEEE
16 years 15 days ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
152
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The complexity of round robin iterative data flow analysis has been traditionally defined as 1+d where d is the depth of a control flow graph. However, this bound is restricted to ...
187
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--This paper deals with the uplink of a wireless multiple-input multiple-output (MIMO) communication system based on multicarrier (MC) code division multiple access (CDMA)....
172
click to vote
ICST
2009
IEEE
16 years 24 days ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...