989 search results - page 109 / 198 » Version spaces and the consistency problem |
162
click to vote
CAV
2000
Springer
15 years 9 months ago
2000
Springer
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
155
click to vote
PERCOM
2007
ACM
16 years 5 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
174
click to vote
ICFP
2007
ACM
16 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
168
click to vote
CPAIOR
2008
Springer
15 years 7 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
153
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a new method — the Time-delay Added Evolutionary Forecasting (TAEF) method — for time series prediction which performs an evolutionary search of the minimu...