Sciweavers

520 search results - page 89 / 104
» Subset Counting in Trees
Sort
View
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 3 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 3 months ago
Improving cooperative GP ensemble with clustering and pruning for pattern classification
A boosting algorithm based on cellular genetic programming to build an ensemble of predictors is proposed. The method evolves a population of trees for a fixed number of rounds an...
Gianluigi Folino, Clara Pizzuti, Giandomenico Spez...
EDBT
2000
ACM
15 years 3 months ago
Navigation-Driven Evaluation of Virtual Mediated Views
The MIX mediator systems incorporates a novel framework for navigation-driven evaluation of virtual mediated views. Its architecture allows the on-demand computation of views and q...
Bertram Ludäscher, Yannis Papakonstantinou, P...
FOSSACS
2010
Springer
15 years 3 months ago
Untyped Recursion Schemes and Infinite Intersection Types
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...
Takeshi Tsukada, Naoki Kobayashi
ESWS
2009
Springer
15 years 3 months ago
Hybrid Adaptive Web Service Selection with SAWSDL-MX and WSDL-Analyzer
Abstract. In this paper, we present an adaptive, hybrid semantic matchmaker for SAWSDL services, called SAWSDL-MX2. It determines three kinds of semantic service similarity with a ...
Matthias Klusch, Patrick Kapahnke, Ingo Zinnikus