Sciweavers

363 search results - page 57 / 73
» About paths with two blocks
Sort
View
ICCAD
2010
IEEE
186views Hardware» more  ICCAD 2010»
13 years 8 months ago
Efficient state space exploration: Interleaving stateless and state-based model checking
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
Malay K. Ganai, Chao Wang, Weihong Li
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 10 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
DSN
2003
IEEE
14 years 3 months ago
A Study of Packet Delivery Performance during Routing Convergence
Internet measurements have shown that network failures happen frequently, and that existing routing protocols can take multiple seconds, or even minutes, to converge after a failu...
Dan Pei, Lan Wang, Daniel Massey, Shyhtsun Felix W...
ARTMED
2006
70views more  ARTMED 2006»
13 years 10 months ago
Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions, and periodic repetiti...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
SAB
2010
Springer
237views Optimization» more  SAB 2010»
13 years 8 months ago
BeeIP: Bee-Inspired Protocol for Routing in Mobile Ad-Hoc Networks
We introduce a new bee-inspired routing protocol for mobile ad hoc networks. Emphasis is given to the ability of bees to evaluate paths by considering several quality factors. In o...
Alexandros Giagkos, Myra S. Wilson