default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6. VALUETOOLS 2011: Paris, France
- Samson Lasaulce, Dieter Fiems, Peter G. Harrison, Luc Vandendorpe:
5th International ICST Conference on Performance Evaluation Methodologies and Tools Communications, VALUETOOLS '11, Paris, France, May 16-20, 2011. ICST/ACM 2011, ISBN 978-1-936968-09-1 - Jacob Christiaan Engwerda
, P. V. Reddy:
A positioning of cooperative differential games. 1-8 - Hamidou Tembine:
Large-scale games in large-scale systems. 9-17 - Lara Briñón-Arranz, Alain Sarlette, Alexandre Seuret, Carlos Canudas de Wit:
Collaborative estimation of gradient direction by a formation of AUVs. 18-27 - Olivier Bokanowski, Anna Désilles, Hasnaa Zidani:
HJB approach for motion planning and reachabilty analysis. 28-36 - Richard Combes, Zwi Altman, Eitan Altman:
A self-optimization method for coverage-capacity optimization in OFDMA networks with MIMO. 37-46 - Urtzi Ayesta, Martin Erausquin, Matthieu Jonckheere, Ina Maria Verloop:
Stability and asymptotic optimality of opportunistic schedulers in wireless systems. 47-56 - Niek Bouman, Sem C. Borst, J. S. H. van Leeuwaarden:
Stability of spatial wireless systems with random admissible-set scheduling. 57-65 - Salman Malik, Alonso Silva, Jean-Marc Kelif:
Optimal base station placement: a stochastic method using interference gradient in downlink case. 66-73 - Patrick Tortelier:
Analytic performance evaluation of opportunistic spectrum access with detection errors. 74-80 - Veeraruna Kavitha:
Continuous polling with rerouting and applications to ferry assisted wireless LANs. 81-90 - Nikolas Anastasiou, Tzu-Ching Horng, William J. Knottenbelt:
Deriving generalised stochastic Petri net performance models from high-precision location tracking data. 91-100 - Peter G. Harrison, Catalina M. Lladó:
Hierarchically constructed Petri-nets and product-forms. 101-110 - Laura Carnevali, Johnny Giuntini, Enrico Vicario:
A symbolic approach to quantitative analysis of preemptive real-time systems with non-Markovian temporal parameters. 111-120 - Enrico Barbierato, Marco Gribaudo, Mauro Iacono:
Exploiting multiformalism models for testing and performance evaluation in SIMTHESys. 121-130 - Minji Kim, Muriel Médard, João Barros:
Modeling network coded TCP throughput: a simple model and its validation. 131-140 - Stefan Dierks, Onurcan Iscan, Christoph Hausl:
Network coding schemes for the multiple-access relay channel. 141-150 - Charly Poulliat, Marco Di Renzo:
Joint network/channel decoding for heterogeneous multi-source/multi-relay cooperative networks. 151-156 - Koen De Turck, Dieter Fiems, Stijn De Vuyst, Herwig Bruneel, Sabine Wittevrongel:
Large-deviations analysis for energy-saving mechanisms in wireless networks. 157-165 - Andrea Marin, Samuel Rota Bulò:
Explicit solutions for queues with hypo-exponential service time and applications to product-form analysis. 166-175 - Michail Makaronidis, Giuliano Casale:
Efficient parallelization of the Method of Moments for queueing networks using multi-modular algebra. 176-185 - Linar Mikeev, Werner Sandmann, Verena Wolf:
Efficient calculation of rare event probabilities in Markovian queueing networks. 186-196 - Hind Castel-Taleb, Idriss Ismael Aouled, Nihal Pekergin:
Bounding techniques for transient analysis of G-networks with catastrophes. 197-206 - Furcy Pin, Ana Busic, Bruno Gaujal:
Acceleration of perfect sampling by skipping events. 207-216 - Panayotis Mertikopoulos, Aris L. Moustakas:
Selfish routing revisited: degeneracy, evolution and stochastic fluctuations. 217-226 - Pascal Bianchi, Jérémie Jakubowicz:
Distributed stochastic approximation for constrained and unconstrained optimization. 227-233 - Tansu Alpcan:
A framework for optimization under limited information. 234-243 - Slawomir Stanczak, Michal Kaliszan, Mario Goldenbaum:
On distributed power control and transceiver optimization in wireless networks. 244-253 - Mariem Krichen, Johanne Cohen, Dominique Barth:
Model for sharing femto access. 254-264 - Julio Rojas-Mora, Tania Jiménez, Eitan Altman:
Simulating flow level bandwidth sharing with pareto distributed file sizes. 265-273 - Yosr Naïja, Kaouthar Blibech:
HS-measure: a hybrid clustering validity measure to interpret road traffic data. 274-280 - Qinghui Xu, Daniel Migault, Stéphane Sénécal, Stanislas Francfort:
K-means and adaptive k-means algorithms for clustering DNS traffic. 281-290 - Géza Szabó, Zoltán Richard Turányi, László Toka, Sándor Molnár, Alysson Santos:
Automatic protocol signature generation framework for deep packet inspection. 291-299 - Majed Haddad, Eitan Altman, Rachid El Azouzi, Tania Jiménez, Salah-Eddine Elayoubi, Sana Ben Jamaa, Arnaud Legout, Ashwin Rao:
A survey on YouTube streaming service. 300-305 - Paolo Ballarini, Hilal Djafri, Marie Duflot, Serge Haddad, Nihal Pekergin:
HASL: an expressive language for statistical verification of stochastic models. 306-315 - Thomas Courtat, Stéphane Douady, Catherine Gloaguen:
Centrality maps and the analysis of city street networks. 316-321 - Ishai Menache, Asuman E. Ozdaglar, Nahum Shimkin:
Socially optimal pricing of cloud computing resources. 322-331 - Panayotis Mertikopoulos, Elena Veronica Belmega, Aris L. Moustakas, Samson Lasaulce:
Dynamic power allocation games in parallel multiple access channels. 332-341 - Giacomo Bacci, Alessandro Bulzomato, Marco Luise:
Uplink power control and subcarrier assignment for an OFDMA multicellular network based on game theory. 342-351 - Alexandros Gkogkas, Roberto Roverso, Seif Haridi:
Accurate and efficient simulation of bandwidth dynamics for peer-to-peer overlay networks. 352-361 - Andrey Garnaev, Yezekael Hayel, Konstantin Avrachenkov, Eitan Altman:
Throughput and QoS pricing in wireless communication. 362-371 - François Mériaux, Samson Lasaulce, Michel Kieffer:
More about base station location games. 372-380 - Anne Bouillard, Aurore Junier:
Worst-case delay bounds with fixed priorities using network calculus. 381-390 - Sebastian Vastag:
Modeling quantitative requirements in SLAs with network calculus. 391-398 - Jean-Philippe Georges, Thierry Divoux, Eric Rondeau:
Network calculus: application to switched real-time networking. 399-407 - Jing Xie, Yuming Jiang:
A temporal network calculus approach to service guarantee analysis of stochastic networks. 408-417 - Hind Castel-Taleb, Nihal Pekergin:
On the choice of the stochastic comparison method for multidimensional Markov chains analysis. 418-424 - Peter Jacko:
Optimal index rules for single resource allocation to stochastic dynamic competitors. 425-433 - Alexander I. Zeifman, Sergey Shorgin, Anna Korotysheva, Vladimir Bening:
Stability bounds for Mt/Mt/N/N + R queue. 434-438 - Maxime Cordy, Marie-Ange Remiche:
QBD sensitivity analysis tool using discrete-event simulation and extension of SMCSolver. 439-446 - Koen De Turck, Dieter Fiems, Sabine Wittevrongel, Herwig Bruneel:
A Taylor series expansions approach to queues with train arrivals. 447-455 - Guy Latouche, Giang Nguyen, Zbigniew Palmowski:
Two-buffer fluid models with multiple ON-OFF inputs and threshold assistance. 456-462 - Konstantin Avrachenkov, Ali Eshragh, Jerzy A. Filar:
Hamiltonian transition matrices. 463-466
Gamecomm 2011
- Marcin Parzy, Hanna Bogucka:
Coopetition: practical methodology for efficient sharing of radio resources in wireless networks. 467-475 - Frank Nebel:
Graph-based coalitional games: an analysis via characteristics. 476-485 - Farshad Shams, Giacomo Bacci, Marco Luise:
Low complexity resource allocation for OFDMA based on coalitional game theory. 486-495 - Francesco Renna, Nicola Laurenti, Yih-Chun Hu:
The jamming game in an OFDM setting. 496-505 - Anil Kumar Chorppath, Tansu Alpcan:
Adversarial behavior in network mechanism design. 506-514 - Sourabh Bhattacharya, Ali Khanafer, Tamer Basar:
Power allocation in team jamming games in wireless ad hoc networks. 515-524 - Eitan Altman, Richard Combes, Zwi Altman, Sylvain Sorin:
Routing games in the many players regime. 525-527 - Dusit Niyato, Kun Zhu, Ping Wang:
Cooperative virtual machine management for multi-organization cloud computing environment. 528-537 - Fei Shen, Eduard A. Jorswieck:
Universal linear pricing for multiple access and broadcast channels under QoS requirements. 538-547 - Maël Le Treust, Samson Lasaulce:
The price of re-establishing perfect, almost perfect or public monitoring in games with arbitrary monitoring. 548-557 - Ali Kakhbod, Ashutosh Nayyar, Demosthenis Teneketzis:
Revenue maximization in spectrum auction for dynamic spectrum access. 558-564 - Samir Medina Perlaza, Samson Lasaulce, Hamidou Tembine, Mérouane Debbah:
Learning to use the spectrum in self-configuring heterogenous networks: a logit equilibrium approach. 565-571 - Hamidou Tembine, Pedro Vilanova, Mohamad Assaad, Mérouane Debbah:
Mean field stochastic games for SINR-based medium access control. 572-581
NCMIP 2011
- Gaël Rigaud, Maï K. Nguyen, Alfred K. Louis:
Circular harmonic decomposition approach for numerical inversion of circular Radon transforms. 582-591 - Mehdi Benhamouche, Lionel Pichon, Laurent Bernard, Dominique Lesselier:
3D modelling of ElectroMagnetic time reversal: localization of a dielectric object in a half-space. 592-596 - Mikael Carlavan, Laure Blanc-Féraud:
Regularizing parameter estimation for Poisson noisy image restoration. 597-601 - Robert Azencott, Anando Sen, Bernhard G. Bodmann, King C. Li, Demetrio Labate, Xiaobo Zhou:
Searchlight CT: a new reconstruction method for collimated X-ray tomography. 602-606 - Jonathan Denies, Hamid Ben Ahmed, Bruno Dehez:
Topology optimization for solving electromagnetic inverse problem. 607-611 - Dominique Placko, Thierry Bore, Pierre-Yves Joubert:
Imaging and detection of cracks in metallic structures with eddy current sensors. 612-620 - François-Xavier Dupé, Jalal Fadili, Jean-Luc Starck:
Linear inverse problems with various noise models and mixed regularizations. 621-626 - Anthony Quinn:
Recursive inference for inverse problems using variational Bayes methodology. 627-635
Securenets 2011
- Mari Kobayashi, Pablo Piantanida, Shlomo Shamai, Sheng Yang:
On the multi-antenna wiretap channel with delayed CSI at the transmitter. 636-640 - Laura Luzzi, Matthieu R. Bloch:
Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels. 641-647 - Paolo Baracca, Nicola Laurenti, Stefano Tomasin:
Physical layer authentication over an OFDM fading wiretap channel. 648-657 - Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendorpe:
MAC with partially cooperating encoders and security constraints. 658-664 - Joffrey Villard, Pablo Piantanida:
Secure distributed lossless compression with side information at the eavesdropper. 665-672 - Rongqing Zhang, Lingyang Song, Zhu Han, Bingli Jiao:
Relay and jammer cooperation as a coalitional game in secure cooperative wireless networks. 673-678 - Francesco Renna, Nicola Laurenti, H. Vincent Poor:
Achievable secrecy rates for wiretap OFDM with QAM constellations. 679-686
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-20 19:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
