Sciweavers

2031 search results - page 265 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ESA
2006
Springer
96views Algorithms» more  ESA 2006»
15 years 1 months ago
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
ESWS
2006
Springer
15 years 1 months ago
WSTO: A Classification-Based Ontology for Managing Trust in Semantic Web Services
The aim of this paper is to provide a general ontology that allows the specification of trust requirements in the Semantic Web Services environment. Both client and Web Service can...
Stefania Galizia
FSTTCS
2006
Springer
15 years 1 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
GECCO
2006
Springer
186views Optimization» more  GECCO 2006»
15 years 1 months ago
Genetic programming for agricultural purposes
Nitrogen is one of the most important chemical intakes to ensure the healthy growth of agricultural crops. However, some environmental concerns emerge (soil and water pollution) w...
Clément Chion, Luis E. Da Costa, Jacques-An...
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
15 years 1 months ago
The role of diverse populations in phylogenetic analysis
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
Tiffani L. Williams, Marc L. Smith