Sciweavers

796 search results - page 157 / 160
» The canonical function game
Sort
View
JSS
2006
127views more  JSS 2006»
13 years 7 months ago
An approach to feature location in distributed systems
This paper describes an approach to the feature location problem for distributed systems, that is, to the problem of locating which code components are important in providing a pa...
Dennis Edwards, Sharon Simmons, Norman Wilde
IANDC
2007
152views more  IANDC 2007»
13 years 7 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
TWC
2008
120views more  TWC 2008»
13 years 7 months ago
Cooperation Enforcement and Learning for Optimizing Packet Forwarding in Autonomous Wireless Networks
In wireless ad hoc networks, autonomous nodes are reluctant to forward others' packets because of the nodes' limited energy. However, such selfishness and noncooperation ...
Charles Pandana, Zhu Han, K. J. Ray Liu
AI
2002
Springer
13 years 7 months ago
Improving heuristic mini-max search by supervised learning
This article surveys three techniques for enhancing heuristic game-tree search pioneered in the author's Othello program Logistello, which dominated the computer Othello scen...
Michael Buro
CACM
2002
106views more  CACM 2002»
13 years 7 months ago
Testing and demonstrating context-aware services with Quake III Arena
Developers of context-aware services, i.e. services that make use of sensory information from the environment of their users, often find testing and demonstrating services to be di...
Markus Bylund, Fredrik Espinoza