5015 search results - page 389 / 1003 » Model Checking a Path |
161
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
With the fast increase in Web activities, Web data mining has recently become an important research topic. However, most previous studies of mining path traversal patterns are bas...
176
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior ...
189
click to vote
SAS
2010
Springer
15 years 5 months ago
2010
Springer
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
180
click to vote
NAS
2010
IEEE
15 years 5 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...
162
click to vote
KBSE
2007
IEEE
16 years 29 days ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...