742 search results - page 127 / 149 » Model Independent Order Relations for Processes |
127
click to vote
NAS
2010
IEEE
15 years 8 days 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...
110
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: Accurate identification of novel, functional noncoding (nc) RNA features in genome sequence has proven more difficult than for exons. Current algorithms identify and s...
121
click to vote
SIAMDM
2008
15 years 1 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
130
Voted
FUIN
2010
15 years 12 days ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
129
click to vote
SIGIR
2011
ACM
14 years 4 months ago
2011
ACM
Searching is inherently an interactive process usually requiring numerous iterations of querying and assessing in order to find the desired amount of relevant information. Essent...