272 search results - page 44 / 55 » Linking Domain Models and Process Models for Reference Model... |
NAS
2010
IEEE
13 years 7 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...
WIKIS
2010
ACM
14 years 29 days ago
2010
ACM
While text versioning was definitely a part of the original hypertext concept [21, 36, 44], it is rarely considered in this context today. Still, we know that revision control un...
TII
2011
13 years 4 months ago
2011
Abstract—Software systems that do not meet their timing constraints can cause risks. In this work, we propose a comprehensive method for assessing the risk of timing failure by e...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...