6693 search results - page 997 / 1339 » On an anytime algorithm for control |
155
click to vote
DIALM
2008
ACM
15 years 5 months ago
2008
ACM
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
141
click to vote
DOLAP
2008
ACM
15 years 5 months ago
2008
ACM
With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail...
153
click to vote
FMCAD
2008
Springer
15 years 5 months ago
2008
Springer
el Sequential Memory Abstraction for Model Checking Per Bjesse Advanced Technology Group Synopsys Inc. Many designs intermingle large memories with wide data paths and nontrivial c...
116
click to vote
AAAI
2010
15 years 5 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
146
click to vote
ALENEX
2010
15 years 5 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...