Sciweavers

963 search results - page 100 / 193
» Escape Analysis on Lists
Sort
View
JAIR
2011
173views more  JAIR 2011»
14 years 3 months ago
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
The ignoring delete lists relaxation is of paramount importance for both satisficing and optimal planning. In earlier work, it was observed that the optimal relaxation heuristic ...
J. Hoffmann
JCDL
2011
ACM
272views Education» more  JCDL 2011»
14 years 3 months ago
CollabSeer: a search engine for collaboration discovery
Collaborative research has been increasingly popular and important in academic circles. However, there is no open platform available for scholars or scientists to effectively dis...
Hung-Hsuan Chen, Liang Gou, Xiaolong Zhang, Clyde ...
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 3 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
SPAA
2005
ACM
15 years 6 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...