1265 search results - page 183 / 253 » Computer poker: A review |
105
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...
115
Voted
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
104
Voted
ERSHOV
1999
Springer
15 years 6 months ago
1999
Springer
The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its transla...
136
click to vote
GD
1998
Springer
15 years 6 months ago
1998
Springer
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
CHI
1997
ACM
15 years 6 months ago
1997
ACM
We describe a case study of a complex, ongoing, collaborative work process, where the central activity is a series of meetings reviewing a wide range of subtle technical topics. T...