1650 search results - page 199 / 330 » The HOM problem is decidable |
156
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
176
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
163
click to vote
AAAI
2007
15 years 8 months ago
2007
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
179
click to vote
AIPS
2008
15 years 8 months ago
2008
This paper addresses the problem of deciding effectively whether to interrupt a teammate who may have information that is valuable for solving a collaborative scheduling problem. ...
174
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We show that the vertices of any plane graph in which every face is of length at least g can be colored by (3g - 5)/4 colors so that every color appears in every face. This is nea...