Sciweavers

2950 search results - page 412 / 590
» Computing with Infinitely Many Processes
Sort
View
CCGRID
2009
IEEE
16 years 1 months ago
Natively Supporting True One-Sided Communication in
As high-end computing systems continue to grow in scale, the performance that applications can achieve on such large scale systems depends heavily on their ability to avoid explic...
Gopalakrishnan Santhanaraman, Pavan Balaji, K. Gop...
ATAL
2010
Springer
15 years 7 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
15 years 4 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
GIS
2006
ACM
16 years 7 months ago
Optimization of multiple continuous queries over streaming satellite data
Remotely sensed data, in particular satellite imagery, play many important roles in environmental applications and models. In particular applications that study (rapid) changes in...
Quinn Hart, Michael Gertz