3446 search results - page 172 / 690 » A Reasoning Algorithm for pD* |
199
Voted
AI
2008
Springer
15 years 4 months ago
2008
Springer
The work in this paper is directed towards sophisticated formalisms for reasoning under probabilistic uncertainty in ontologies in the Semantic Web. Ontologies play a central role...
121
click to vote
IEICET
2006
15 years 4 months ago
2006
Abstract--We propose several heuristic algorithms that reconfigure logical topologies in wide-area wavelength-routed optical networks. Our reconfiguration algorithms attempt to kee...
161
Voted
APPROX
2011
Springer
14 years 4 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
131
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
256
click to vote
PLDI
2009
ACM
16 years 4 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...