Sciweavers

520 search results - page 76 / 104
» New Complexity Results for Classical Planning Benchmarks
Sort
View
PODS
2010
ACM
170views Database» more  PODS 2010»
14 years 1 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...
SAC
2002
ACM
13 years 8 months ago
Decision tree classification of spatial data streams using Peano Count Trees
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...
Qiang Ding, Qin Ding, William Perrizo
AIPS
2008
13 years 10 months ago
Stochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
Jia-Hong Wu, Rajesh Kalyanam, Robert Givan
SPATIALCOGNITION
2004
Springer
14 years 1 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
TC
2008
13 years 8 months ago
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over ti...
Olav Lysne, José Miguel Montañana, J...