„network programming“

Suchergebnisse

8.178 Treffer

• Datenströme
  Bry, François ; Furche, Tim ; Olteanu, Dan
• Evaluating the performance and energy efficiency of the COSMO-ART model system
  Charles, Joseph ; Sawyer, William ; Dolz, Manuel F. ; Catalán, Sandra
• Performance and power consumption evaluation of concurrent queue implementations in embedded systems
  Papadopoulos, Lazaros ; Walulya, Ivan ; Renaud-Goud, Paul ; Tsigas, Philippas ; Soudris, Dimitrios ; Barry, Brendan
• Logics of knowledge and action: critical analysis and challenges
  Herzig, Andreas
• Efficient distributed computation of distance sketches in networks
  Sarma, Atish Das ; Dinitz, Michael ; Pandurangan, Gopal
• Compositional verification of asynchronous concurrent systems using CADP
  Garavel, Hubert ; Lang, Frédéric ; Mateescu, Radu
• A Logical and Ontological Framework for Compositional Concepts of Objects and Properties
  Kaneiwa, Ken ; Mizoguchi, Riichiro ; Nguyen, Philip H. P.
• Secure outsourced computation of the characteristic polynomial and eigenvalues of matrix
  Hu, Xing ; Tang, Chunming
• A quality model for social networks populated with web services
  Faci, Noura ; Petrocchi, Marinella ; Costantino, Gianpiero ; Martinelli, Fabio ; Maamar, Zakaria
• Ontologies and Reasoning in Enterprise Service Ecosystems
  Oberle, Daniel
• Design and Programming Tools for Time Critical Applications
  Ancilotti, Paolo ; Buttazzo, Giorgio ; Natale, Marco Di ; Spuri, Marco
• Tropos: An Agent-Oriented Software Development Methodology
  Bresciani, Paolo ; Perini, Anna ; Giorgini, Paolo ; Giunchiglia, Fausto ; Mylopoulos, John
• Deployment of Mobile Switching Centers in a Telecommunications Network: A Stochastic Programming Approach
  Riis, Morten ; Skriver, Anders J.V ; Lodahl, Jørn
• Performances of an algorithm constructing a nearly optimal binary tree
  Akdag, Herman
• Indépendance forte de certaines opérations
  Rodriguez, F.
• A characterization of database graphs admitting a simple locking protocol
  Kedem, Zvi ; Silberschatz, Abraham
• A principle of independence for binary tree searching
  Guibas, Leo J.
• The complexity of drawing trees nicely
  Supowit, Kenneth J. ; Reingold, Edward M.
• Monoïdes syntactiques des langages algébriques
  Perrot, J. -F
• Concurrency and Trie Hashing
  Litwin, W. ; Sagiv, Y. ; Vidyasankar, K.