1529 search results - page 26 / 306 » Search Space Analysis of the Linear Ordering Problem |
148
Voted
CADE
2005
Springer
16 years 4 months ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
111
click to vote
ICCD
2006
IEEE
16 years 20 days ago
2006
IEEE
Abstract— In this paper, we introduce a novel preimage computation technique that directly computes the circuit cofactors without an explicit search for any satisfiable solution...
130
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We...
125
Voted
IJCAI
2007
15 years 5 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
125
Voted
AAAI
2008
15 years 6 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...