Sciweavers

259 search results - page 46 / 52
» Continuous Drifting Games
Sort
View
DASFAA
2008
IEEE
156views Database» more  DASFAA 2008»
13 years 7 months ago
Load Balancing for Moving Object Management in a P2P Network
Abstract. Online games and location-based services now form the potential application domains for the P2P paradigm. In P2P systems, balancing the workload is essential for overall ...
Mohammed Eunus Ali, Egemen Tanin, Rui Zhang, Lars ...
AUTOMATICA
2007
179views more  AUTOMATICA 2007»
13 years 7 months ago
Approximate bisimulation relations for constrained linear systems
In this paper, we define the notion of approximate bisimulation relation between two continuous systems. While exact bisimulation requires that the observations of two systems ar...
Antoine Girard, George J. Pappas
ML
2006
ACM
113views Machine Learning» more  ML 2006»
13 years 7 months ago
Learning to bid in bridge
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
Asaf Amit, Shaul Markovitch
SIGCSE
2008
ACM
161views Education» more  SIGCSE 2008»
13 years 7 months ago
Improving retention and graduate recruitment through immersive research experiences for undergraduates
Research experiences for undergraduates are considered an effective means for increasing student retention and encouraging undergraduate students to continue on to graduate school...
Teresa A. Dahlberg, Tiffany Barnes, Audrey Rorrer,...
TCS
2008
13 years 7 months ago
Cleaning a network with brushes
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
Margaret-Ellen Messinger, Richard J. Nowakowski, P...