Results 1  10
of
221
Voronoi Games and Epsilon Nets
"... Competitive facility location is concerned with the strategic placement of facilities by competing market players. In the Discrete Voronoi Game V G(k, l), two players P1 and P2, respectively, strive to attract as many of n users as possible. Initially, P1 first chooses a set F of k locations in the ..."
Abstract
 Add to MetaCart
Competitive facility location is concerned with the strategic placement of facilities by competing market players. In the Discrete Voronoi Game V G(k, l), two players P1 and P2, respectively, strive to attract as many of n users as possible. Initially, P1 first chooses a set F of k locations
Global Optimization Algorithms  Theory and Application
, 2011
"... This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered ..."
Abstract

Cited by 94 (26 self)
 Add to MetaCart
This ebook is devoted to Global Optimization algorithms, which are methods for finding solutions of high quality for an incredible wide range of problems. We introduce the basic concepts of optimization and discuss features which make optimization problems difficult and thus, should be considered when trying to solve them. In this book, we focus on
Algorithms and Data Structures for External Memory
, 2006
"... Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Str ..."
Abstract

Cited by 84 (6 self)
 Add to MetaCart
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs. A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory. Algorithms and Data Structures for External Memory describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. Algorithms and Data Structures for External Memory is an invaluable reference for anybody interested in, or conducting research in the design, analysis, and implementation of algorithms and data structures. This book is originally published as
Proceedings of the SAB'06 Workshop on Adaptive Approaches for Optimizing Player Satisfaction in Computer and Physical Games
, 2006
"... We were motivated by the current stateoftheart in intelligent game design using adaptive approaches. Artificial Intelligence (AI) techniques are mainly focused on generating humanlike and intelligent character behaviors. Meanwhile there is generally little further analysis of whether these behav ..."
Abstract
 Add to MetaCart
We were motivated by the current stateoftheart in intelligent game design using adaptive approaches. Artificial Intelligence (AI) techniques are mainly focused on generating humanlike and intelligent character behaviors. Meanwhile there is generally little further analysis of whether
Keynote Talk 1 Stream: Keynote Speakers Invited session
"... When optimizing under stochastic uncertainty, the entity of primary importance is a chance constraint Prob qsi>P f(x;qsi) in Q> = 1 epsilon, for all P in PP where x is the decision vector, qsi is a random perturbation with distribution P known to belong to a given family PP, Q is a given tar ..."
Abstract
 Add to MetaCart
When optimizing under stochastic uncertainty, the entity of primary importance is a chance constraint Prob qsi>P f(x;qsi) in Q> = 1 epsilon, for all P in PP where x is the decision vector, qsi is a random perturbation with distribution P known to belong to a given family PP, Q is a given
The Holodeck: A Parallel Raycaching Rendering System
"... This paper presents a new data structure for light field rendering, which resembles a Star Trek holodeck in form and function. The grid on a holodeck section acts as a fourdimensional rendering target for a ray tracing algorithm, whose goal is to update an interactive display. A holodeck server coor ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
coordinates separate ray evaluation and display processes, optimizing disk and memory usage. Holodeck data may also be computed offline, and displayed later with or without an interactive ray calculation. Since the rendering hardware is not being taxed by either geometry or lighting, the net result
Pure Equilibria: Existence and Inefficiency & Online Auction
, 2009
"... Every atom in universe exists in equilibrium of different physical forces. Everyone in society lives in equilibrium of their work and family, of their enthusiasm and reality. Equilibrium is one of the main notions in Game Theory — the domain studies behaviors of entities according to their own inter ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Every atom in universe exists in equilibrium of different physical forces. Everyone in society lives in equilibrium of their work and family, of their enthusiasm and reality. Equilibrium is one of the main notions in Game Theory — the domain studies behaviors of entities according to their own
Efficient Proximity Detection among Mobile Users via SelfTuning Policies
, 2010
"... Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean distance between them is within the given threshold. This problem plays an essential role in friendlocator applications ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
locator applications and massively multiplayer online games. Existing proximity detection solutions either incur substantial location update costs or their performance does not scale well to a large number of users. Motivated by this, we present a centralized proximity detection solution that assigns each mobile
The Informational Complexity of Learning from Examples
, 1996
"... This thesis attempts to quantify the amount of information needed to learn certain tasks. The tasks chosen vary from learning functions in a Sobolev space using radial basis function networks to learning grammars in the principles and parameters framework of modern linguistic theory. These problem ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
This thesis attempts to quantify the amount of information needed to learn certain tasks. The tasks chosen vary from learning functions in a Sobolev space using radial basis function networks to learning grammars in the principles and parameters framework of modern linguistic theory. These problems are analyzed from the perspective of computational learning theory and certain unifying perspectives emerge. Copyright c fl Massachusetts Institute of Technology, 1996 This report describes research done within the Center for Biological and Computational Learning in the Department of Brain and Cognitive Sciences and at the Artificial Intelligence Laboratory at the Massachusetts Institute of Technology. This research is sponsored by a grant from the National Science Foundation under contract ASC9217041 (this award includes funds from ARPA provided under the HPCC program); and by a grant from ARPA/ONR under contract N0001492J1879. Additional support has been provided by Siemens Co...
Results 1  10
of
221