Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Stochastic Node Caching for Memory-bounded Search
Sort
relevance
views
votes
recent
update
View
thumb
title
37
click to vote
IJCAI
2007
194
views
Artificial Intelligence
»
more
IJCAI 2007
»
MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
13 years 11 months ago
Download
www.ijcai.org
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
Adrian Petcu, Boi Faltings
claim paper
Read More »
16
click to vote
AAAI
1998
109
views
Intelligent Agents
»
more
AAAI 1998
»
Stochastic Node Caching for Memory-bounded Search
13 years 11 months ago
Download
www.ai.soc.i.kyoto-u.ac.jp
Teruhisa Miura, Toru Ishida
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »