string(237) "select * FROM articoli_opac WHERE fonte <> 'ISI' AND fonte='ACNP' AND fasc_anno_pubbl='1996' AND fasc_issn='10534830' order by level desc, fasc_key desc, NULLIF(regexp_replace(pagina_ini, E'\\D', '', 'g'), '')::int asc offset 0 limit 25" ACNP - Italian Periodicals Catalogue
Results: 1-13    

Articles table of contents

Results : 13
ABA: an assignment based algorithm for resource allocation
Authors: C.P.Gomes,J.Hsu
Journal: SIGART bulletin
Citation: C.p.gomes,j.hsu, ABA: an assignment based algorithm for resource allocation, SIGART bulletin , 7(1), 1996, pp. 2-8
The casual Markov condition, fact or artifact?
Authors: J.F.Lemmer
Journal: SIGART bulletin
Citation: J.f.lemmer, The casual Markov condition, fact or artifact?, SIGART bulletin , 7(3), 1996, pp. 3-16
Context-Dependent computational components
Authors: T.L.Dean
Journal: SIGART bulletin
Citation: T.l.dean, Context-Dependent computational components, SIGART bulletin , 7(2), 1996, pp. 3-6
An efficient algorithm for managing partial orders in planning
Authors: M.Fox,D.Long
Journal: SIGART bulletin
Citation: M.fox,d.long, An efficient algorithm for managing partial orders in planning, SIGART bulletin , 7(4), 1996, pp. 3-12
Anytime algorithms for constraint satisfaction and SAT problems
Authors: R.J.Wallace,E.C.Freuder
Journal: SIGART bulletin
Citation: R.j.wallace,e.c.freuder, Anytime algorithms for constraint satisfaction and SAT problems, SIGART bulletin , 7(2), 1996, pp. 7-10
Timed common lisp: the duration of deliberation
Authors: S.D.Anderson,P.R.Cohen
Journal: SIGART bulletin
Citation: S.d.anderson,p.r.cohen, Timed common lisp: the duration of deliberation, SIGART bulletin , 7(2), 1996, pp. 11-15
Complexity, ontology, and the casual Markov assumption
Authors: P.B.Losiewicz
Journal: SIGART bulletin
Citation: P.b.losiewicz, Complexity, ontology, and the casual Markov assumption, SIGART bulletin , 7(4), 1996, pp. 13-18
Design-to-time scheduling and anytime algorithms
Authors: A.Garvey,V.Lesser
Journal: SIGART bulletin
Citation: A.garvey,v.lesser, Design-to-time scheduling and anytime algorithms, SIGART bulletin , 7(2), 1996, pp. 16-19
Anytime algorithm development tools
Authors: J.Grass,S.Zilberstein
Journal: SIGART bulletin
Citation: J.grass,s.zilberstein, Anytime algorithm development tools, SIGART bulletin , 7(2), 1996, pp. 20-27
Monitoring anytime algorithms
Authors: E.A.Hansen,S.Zilberstein
Journal: SIGART bulletin
Citation: E.a.hansen,s.zilberstein, Monitoring anytime algorithms, SIGART bulletin , 7(2), 1996, pp. 28-33
Focusing attention in anytime decision-theoretic planning
Authors: P.Haddawy
Journal: SIGART bulletin
Citation: P.haddawy, Focusing attention in anytime decision-theoretic planning, SIGART bulletin , 7(2), 1996, pp. 34-40
Value-density algorithms for the deliberation-scheduling problem
Authors: Y.Ronén,D.Mosse,M.E.Pollack
Journal: SIGART bulletin
Citation: Y.ronén,d.mosse,m.e.pollack, Value-density algorithms for the deliberation-scheduling problem, SIGART bulletin , 7(2), 1996, pp. 41-49
One state-space abstraction for anytime evaluation of bayesian networks
Authors: C.L.Liu,M.P.Wellman
Journal: SIGART bulletin
Citation: C.l.liu,m.p.wellman, One state-space abstraction for anytime evaluation of bayesian networks, SIGART bulletin , 7(2), 1996, pp. 50-57
Results: 1-13