1293 search results - page 166 / 259 » Modelling Smooth Paths Using Gaussian Processes |
ICDE
2002
IEEE
14 years 3 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
NAS
2010
IEEE
13 years 8 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...
ENTCS
2008
13 years 10 months ago
2008
To provide formal foundations to current (web) services technologies, we put forward using COWS, a process calculus for specifying, combining and analysing services, as a uniform ...
ICNP
2005
IEEE
14 years 3 months ago
2005
IEEE
By allowing end hosts to make routing decisions at the application level, different overlay networks may unintentionally interfere with each other. This paper describes how multip...
DATE
2008
IEEE
14 years 4 months ago
2008
IEEE
Shrinking feature sizes and process variations are of increasing concern in modern technology. It is urgent that we develop statistical interconnect timing models which are harmon...