Sciweavers

1058 search results - page 114 / 212
» It's Doomed; We Can Prove It
Sort
View
JAIR
2011
173views more  JAIR 2011»
13 years 29 days 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
AAECC
2003
Springer
139views Algorithms» more  AAECC 2003»
14 years 3 months ago
Fighting Two Pirates
A pirate is a person who buys a legal copy of a copyrighted work and who reproduces it to sell illegal copies. Artists and authors are worried as they do not get the income which i...
Hans Georg Schaathun
SPAA
2010
ACM
14 years 2 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...
INFOCOM
2005
IEEE
14 years 3 months ago
On the interaction between overlay routing and underlay routing
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
Yong Liu, Honggang Zhang, Weibo Gong, Donald F. To...
GD
2004
Springer
14 years 3 months ago
Partitions of Complete Geometric Graphs into Plane Trees
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Cam...