Sciweavers

168 search results - page 11 / 34
» Matching as a non-cooperative game
Sort
View
CORR
2008
Springer
170views Education» more  CORR 2008»
14 years 9 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
ISAAC
2005
Springer
153views Algorithms» more  ISAAC 2005»
15 years 3 months ago
Network Game with Attacker and Protector Entities
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
CVIU
2011
14 years 1 months ago
Graph-based quadratic optimization: A fast evolutionary approach
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
Samuel Rota Bulò, Marcello Pelillo, Immanue...
FLAIRS
2010
14 years 12 months ago
A Game Playing System for Use in Computer Science Education
The MAPLE Game Playing System is a web application and website that allows students to design and program game playing agents using the Python programming language. The system pro...
James MacGlashan, Don Miner, Marie desJardins
CG
2002
Springer
14 years 9 months ago
A Comparison of Algorithms for Multi-player Games
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
Nathan R. Sturtevant