Sciweavers

1599 search results - page 188 / 320
» Algorithms for Parity Games
Sort
View
JSAC
2008
125views more  JSAC 2008»
15 years 6 months ago
Optimal Competitive Algorithms for Opportunistic Spectrum Access
We consider opportunistic spectrum access (OSA) strategies for a transmitter in a multichannel wireless system, where a channel may or may not be available and the transmitter must...
Nicholas B. Chang, Mingyan Liu
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
16 years 16 days ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
ISSTA
2004
ACM
15 years 11 months ago
Optimal strategies for testing nondeterministic systems
This paper deals with testing of nondeterministic software systems. We assume that a model of the nondeterministic system is given by a directed graph with two kind of vertices: s...
Lev Nachmanson, Margus Veanes, Wolfram Schulte, Ni...
ICMCS
2006
IEEE
152views Multimedia» more  ICMCS 2006»
16 years 12 days ago
GPCD: Grid-based Predictive Collision Detection for Large-scale Environments in Computer Games
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
Zhiwen Yu, Hau-San Wong
VL
1996
IEEE
130views Visual Languages» more  VL 1996»
15 years 10 months ago
Seeing Systolic Computations in a Video Game World
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...
Kenneth M. Kahn