Sciweavers

107 search results - page 18 / 22
» When Random Play is Optimal Against an Adversary
Sort
View
IPPS
2002
IEEE
14 years 12 days ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
INFORMS
2010
177views more  INFORMS 2010»
13 years 6 months ago
Binarized Support Vector Machines
The widely used Support Vector Machine (SVM) method has shown to yield very good results in Supervised Classification problems. Other methods such as Classification Trees have bec...
Emilio Carrizosa, Belen Martin-Barragan, Dolores R...
SAC
2006
ACM
14 years 1 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
INFOCOM
2007
IEEE
14 years 1 months ago
QoS-Driven Power Allocation Over Parallel Fading Channels With Imperfect Channel Estimations in Wireless Networks
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...
Jia Tang, Xi Zhang
GECCO
2006
Springer
198views Optimization» more  GECCO 2006»
13 years 11 months ago
Reward allotment in an event-driven hybrid learning classifier system for online soccer games
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
Yuji Sato, Yosuke Akatsuka, Takenori Nishizono