4047 search results - page 683 / 810 » Algebraic Model Checking |
142
Voted
MMB
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
122
click to vote
IJCAI
2003
15 years 4 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
130
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
Recovering multiple point light sources from a sparse set of photographs in which objects of unknown texture can move is challenging. This is because both diffuse and specular ref...
129
Voted
DAC
2008
ACM
16 years 3 months ago
2008
ACM
ng Automatic Abstraction Refinement for Generalized Symbolic Trajectory Evaluation Yan Chen Dept. of Computer Science Portland State University Portland, OR, 97207 chenyan@cs.pdx.e...
90
Voted
ICSE
2008
IEEE-ACM
16 years 3 months ago
2008
IEEE-ACM
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...