Sciweavers

2343 search results - page 132 / 469
» Visual-Concept Search Solved
Sort
View
SAT
2009
Springer
103views Hardware» more  SAT 2009»
15 years 9 months ago
Instance-Based Selection of Policies for SAT Solvers
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic pol...
Mladen Nikolic, Filip Maric, Predrag Janicic
EH
2004
IEEE
89views Hardware» more  EH 2004»
15 years 8 months ago
Evolution in Materio: Initial Experiments with Liquid Crystal
Intrinsic evolution is often limited to using standard electronic components as the media for problem solving. It has been argued that because such components are human designed a...
Simon Harding, Julian Francis Miller
WWW
2007
ACM
16 years 5 months ago
Extraction and search of chemical formulae in text documents on the web
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
Bingjun Sun, Qingzhao Tan, Prasenjit Mitra, C. Lee...
IJCAI
2007
15 years 6 months ago
Transferring Learned Control-Knowledge between Planners
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
Susana Fernández, Ricardo Aler, Daniel Borr...
AAAI
1990
15 years 5 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih