Sciweavers

157 search results - page 31 / 32
» Totality in arena games
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
14 years 7 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
ICTAI
2008
IEEE
14 years 1 months ago
The Performance of Approximating Ordinary Differential Equations by Neural Nets
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
Josef Fojdl, Rüdiger W. Brause
ROBOCUP
2001
Springer
138views Robotics» more  ROBOCUP 2001»
13 years 12 months ago
Interpretation of Spatio-temporal Relations in Real-Time and Dynamic Environments
With the more sophisticated abilities of teams within the simulation league high level online functions become more and more attractive. Last year we proposed an approach to recogn...
Andrea Miene, Ubbo Visser
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
13 years 9 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 7 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...