Search
Now showing items 1-10 of 20
Complexity of rational and irrational Nash equilibria
(2011)
We introduce two new decision problems, denoted as ∃ RATIONAL NASH and ∃ IRRATIONAL NASH, pertinent to the rationality and irrationality, respectively, of Nash equilibria for (finite) strategic games. These problems ask, ...
Direct routing: Algorithms and complexity
(2006)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be delivered to their destinations without collisions. We give a general treatment of three facets of direct ...
Direct routing: Algorithms and complexity
(2004)
Direct routing is the special case of bufferless routing where N packets, once injected into the network, must be routed along specific paths to their destinations without conflicts. We give a general treatment of three ...
On network survivability algorithms based on trellis graph transformations
(1999)
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network survivability. In this paper, we use graph theoretic ...
Market model for level of detail control
(ACM, 1999)
In virtual reality simulations the speed of rendering is vitally important. One of the techniques for controlling the frame rate is the assignment of different levels of detail for each object within a scene. The most ...
Image-based crowd rendering
(2002)
Rendering crowded scenes with thousands of different animated virtual people in real time is challenging. An image-based rendering approach for displaying multiple avatars is proposed. The system allows real-time rendering ...
A switching control strategy for the attenuation of blood glucose disturbances
(2011)
In this computational study we consider a generalized minimal model structure for the intravenously infused insulin-blood glucose dynamics, which can represent a wide variety of diabetic patients, and augment this model ...
Content-selection strategies for the periodic prefetching of WWW resources via satellite
(2001)
In this paper we study satellite-caching, that is, the employment of satellite multicasting for the dissemination of prefetched content to WWW caches. This approach is currently being deployed by major satellite operators ...
FAST: a functional algorithm simulation testbed
(Publ by IEEE, 1994)
In this paper we extend the practical range of simulations of parallel executions by what we call 'functional algorithm simulation,' that is, simulation without actually performing most of the numerical computations involved. ...
Computing Nash equilibria for scheduling on restricted parallel links
(2004)
We consider the problem of routing n users on m parallel links, under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. Thus, the problem is equivalent to the ...