6562 search results - page 86 / 1313 » Noetherianity and Combination Problems |
114
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
1993
ACM
We introduce a new approach for the computation of viewindependent solutions to the diffuse global illumination problem in polyhedral environments. The approach combines ideas fro...
109
click to vote
FROCOS
2007
Springer
15 years 4 months ago
2007
Springer
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
104
Voted
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
118
click to vote
ER
2006
Springer
15 years 4 months ago
2006
Springer
Ontologies on the Semantic Web are by nature decentralized. From the body of ontology mapping approaches, we can draw a conclusion that an effective approach to automate ontology m...
99
Voted
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
The AI optimization algorithm called "Squeaky-Wheel Optimization" (SWO) has proven very effective in a variety of real-world applications. Although the ideas behind SWO ...