Maximizing over multiple pattem databases speeds up heuristic search
- Author
- HOLTE, Robert C1 ; PEINER, Ariel2 ; NEWTON, Jack1 ; MESHULAM, Ram3 ; FURCY, David4
[1] University of Alberta, Computing Science Department, Edmonton, Alberta, T6G 2E8, Canada
[2] Department of Information Systems Engineering, Bar-Gurion University of the Negev, Beer-Sheva, 85105, Israel
[3] Computer Science Department, Bar-Ilan University, Ramat-Gan, 92500, Israel
[4] Computer Science Department, University of Wisconsin Oshkosh, 800 Algoma Boulevard, Oshkosh, WI 54901-8643, United States - Source
Artificial intelligence. 2006, Vol 170, Num 16-17, pp 1123-1136, 14 p ; ref : 26 ref
- CODEN
- AINTBB
- ISSN
- 0004-3702
- Scientific domain
- Computer science
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Admissible heuristics Heuristic search IDA* Pattern databases
- Keyword (fr)
- Base donnée répartie Expression régulière Intelligence artificielle Méthode espace état Méthode heuristique Table conversion Multibase
- Keyword (en)
- Distributed database Regular expression Artificial intelligence State space method Heuristic method Look up table Multiple database
- Keyword (es)
- Base repartida dato Expresión regular Inteligencia artificial Método espacio estado Método heurístico Tabla de consulta Base dato múltiple
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B07 Memory organisation. Data processing / 001D02B07D Information systems. Data bases
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence / 001D02C02 Learning and adaptive systems
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18288711
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.artint.2006.09.002 
https://dx.doi.org/10.1016/j.artint.2006.09.002
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2006.09.002\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Artificial intelligence\";s:9:\"\u0000*\u0000stitle\";s:13:\"Artif. intell\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:3:\"170\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1123\";s:8:\"\u0000*\u0000epage\";s:4:\"1136\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HOLTE\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Robert C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:13:\"PEINER, Ariel\";i:1;s:12:\"NEWTON, Jack\";i:2;s:13:\"MESHULAM, Ram\";i:3;s:12:\"FURCY, David\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2006.09.002\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Artificial intelligence\";s:9:\"\u0000*\u0000stitle\";s:13:\"Artif. intell\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:3:\"170\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1123\";s:8:\"\u0000*\u0000epage\";s:4:\"1136\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HOLTE\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Robert C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:13:\"PEINER, Ariel\";i:1;s:12:\"NEWTON, Jack\";i:2;s:13:\"MESHULAM, Ram\";i:3;s:12:\"FURCY, David\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2006.09.002\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2006.09.002\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Artificial intelligence\";s:9:\"\u0000*\u0000stitle\";s:13:\"Artif. intell\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:3:\"170\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1123\";s:8:\"\u0000*\u0000epage\";s:4:\"1136\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HOLTE\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Robert C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:13:\"PEINER, Ariel\";i:1;s:12:\"NEWTON, Jack\";i:2;s:13:\"MESHULAM, Ram\";i:3;s:12:\"FURCY, David\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:28:\"10.1016\/j.artint.2006.09.002\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:9:\"\u0000*\u0000jtitle\";s:23:\"Artificial intelligence\";s:9:\"\u0000*\u0000stitle\";s:13:\"Artif. intell\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:3:\"170\";s:8:\"\u0000*\u0000issue\";s:5:\"16-17\";s:8:\"\u0000*\u0000spage\";s:4:\"1123\";s:8:\"\u0000*\u0000epage\";s:4:\"1136\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0004-3702\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"HOLTE\";s:10:\"\u0000*\u0000aufirst\";s:8:\"Robert C\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:4:{i:0;s:13:\"PEINER, Ariel\";i:1;s:12:\"NEWTON, Jack\";i:2;s:13:\"MESHULAM, Ram\";i:3;s:12:\"FURCY, David\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AINTBB\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:68:\"Maximizing over multiple pattem databases speeds up heuristic search\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
