Sciweavers

601 search results - page 44 / 121
» Playing large games using simple strategies
Sort
View
LCC
1994
248views Algorithms» more  LCC 1994»
15 years 5 months ago
Comparing the Power of Monadic NP Games
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
Ronald Fagin
ASSETS
2008
ACM
15 years 3 months ago
Sudoku access: a sudoku game for people with motor disabilities
Educational games are a beneficial activity motivating a large number of students in our society. Unfortunately, disabled people have reduced opportunities when using a computer g...
Stéphane Norte, Fernando G. Lobo
CLUSTER
2006
IEEE
15 years 5 months ago
Improving Communication Performance on InfiniBand by Using Efficient Data Placement Strategies
Despite using high-speed network interconnection systems like InfiniBand, the communication overhead for parallel applications is still high. In this paper we show, how such costs...
Robert Rex, Frank Mietke, Wolfgang Rehm, Christoph...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 8 months ago
Finding the optimal strategies for robotic patrolling with adversaries in topologically-represented environments
Abstract— Using autonomous mobile robots to patrol environments for detecting intruders is a topic of increasing relevance for its possible applications. A large part of strategi...
Francesco Amigoni, Nicola Basilico, Nicola Gatti
IOR
2007
74views more  IOR 2007»
15 years 1 months ago
Optimal Strategies for Sports Betting Pools
Abstract. Every fall, millions of Americans enter betting pools to pick winners of the weekly NFL football games. In the spring, NCAA tournament basketball pools are even more popu...
Bryan Clair, David Letscher