<--- Back to Details
First PageDocument Content
NP-complete problems / Network theory / Shortest path problem / Windows Server / Client–server model / Server / Clique / Graph partition / Graph / Graph theory / Theoretical computer science / Mathematics
Date: 2012-10-03 07:49:12
NP-complete problems
Network theory
Shortest path problem
Windows Server
Client–server model
Server
Clique
Graph partition
Graph
Graph theory
Theoretical computer science
Mathematics

Add to Reading List

Source URL: www.dieter.pfoser.org

Download Document from Source Website

File Size: 312,77 KB

Share Document on Facebook

Similar Documents

A Model of Distributed Query Computation in Client-Server Scenarios on the Semantic Web ∗ 1 Olaf Hartig1 , Ian Letter2 , Jorge P´erez3,4 Dept. of Computer and Information Science (IDA), Link¨oping University, Sweden

DocID: 1ugKj - View Document

A Markov Model of Server to Client IP traffic in First Person Shooter Games Philip Branch, Grenville Armitage, Antonio L Cricenti Centre for Advanced Internet Architectures

DocID: 1tRKz - View Document

Ground Rules • No end-runs around the library server – a true client-server model • Client is fully independent of the library server – co-packaging is not necessary

DocID: 1rASX - View Document

Actor model / Concurrent computing / Ike

Set: Client-Server Interposable Modalities Ike Antkaretoo International Institute of Technology United Slates of Earth A BSTRACT

DocID: 1r507 - View Document

Computing / Computer architecture / Inter-process communication / Cross-platform software / Clientserver model / Network architecture / Session / Client / XMPP / Server / Application server

Thialfi: A Client Notification Service for Internet-Scale Applications Atul Adya Gregory Cooper

DocID: 1q2wJ - View Document