575 search results - page 57 / 115 » Model Checking Restricted Sets of Timed Paths |
IWPC
2008
IEEE
15 years 6 months ago
2008
IEEE
Libraries are the most widespreaded form of software reuse. In order to properly use a library API, its clients should fulfill a series of (many times implicit) assumptions made ...
108
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
111
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
RT
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. In this paper we show how Metropolis Light Transport can be extended both in the underlying theoretical framework and the algorithmic implementation to incorporate volume...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...