5015 search results - page 691 / 1003 » Model Checking a Path |
188
click to vote
IIE
2007
15 years 6 months ago
2007
Automatic assessment of programming exercises is typically based on testing approach. Most automatic assessment frameworks execute tests and evaluate test results automatically, bu...
164
click to vote
TOG
2008
15 years 6 months ago
2008
Modeling the large space of possible human motions requires scalable techniques. Generalizing from example motions or example controllers is one way to provide the required scalab...
154
click to vote
IJFCS
1998
15 years 6 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
211
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
197
click to vote
NETWORKS
2007
15 years 6 months ago
2007
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...