5055 search results - page 766 / 1011 » Relative Timing |
197
click to vote
DAM
1999
15 years 6 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
142
click to vote
JSS
2002
15 years 6 months ago
2002
A set of fundamental principles can act as an enabler in the establishment of a discipline; however, software engineering still lacks a set of universally recognized fundamental p...
185
click to vote
DM
1999
15 years 6 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
156
click to vote
MAM
2002
15 years 6 months ago
2002
The use of a centralised planning scheduler in fieldbus-based systems requiring real-time operation has proved to be a good compromise between operational flexibility and timeline...
157
click to vote
PE
2002
Springer
15 years 6 months ago
2002
Springer
Many mathematical models exist for describing the behavior of TCP/IP (TCP: transmission control protocol) under an exogenous loss process that does not depend on the window size. ...