Sciweavers

4137 search results - page 288 / 828
» On the number of matchings of a tree
Sort
View
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 28 days ago
Some novel locality results for the blob code spanning tree representation
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
Tim Paulden, David K. Smith
AIPS
2008
15 years 9 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...
ICDCS
2009
IEEE
16 years 3 months ago
Autonomous Resource Selection for Decentralized Utility Computing
Many large-scale utility computing infrastructures comprise heterogeneous hardware and software resources. This raises the need for scalable resource selection services, which ide...
Paolo Costa, Jeff Napper, Guillaume Pierre, Maarte...
ICRA
2007
IEEE
114views Robotics» more  ICRA 2007»
16 years 1 months ago
Spherical Laser Point Sampling with Application to 3D Scene Genetic Registration
— Scene registration of 3D laser rangefinder scans is increasingly being required in applications, such as mobile robotics, that demand a timely response. For speeding up point ...
Jorge L. Martínez, Antonio Reina, Anthony M...
144
Voted
JCIT
2010
106views more  JCIT 2010»
15 years 1 months ago
Clearing Policy for an Specialist Agent in Marketing Strategies
This work discusses clearing policy used by a specialist agent on marketing strategies under the rules of TAC CAT agents International Tournament. The goal of this agent is to cre...
Miriam Salcedo H., Darnes Vilarino A., Fabiola Lop...