Sciweavers

14518 search results - page 293 / 2904
» Two Problems for Sophistication
Sort
View
ICALP
2005
Springer
16 years 5 days ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
SAT
2005
Springer
133views Hardware» more  SAT 2005»
16 years 4 days ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
CPM
2004
Springer
84views Combinatorics» more  CPM 2004»
16 years 1 days ago
Small Phylogeny Problem: Character Evolution Trees
Abstract. Phylogenetics is a science of determining connections between groups of organisms in terms of ancestor/descendent relationships, usually expressed by phylogenetic trees, ...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
EVOW
2004
Springer
16 years 1 days ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
WEA
2004
Springer
85views Algorithms» more  WEA 2004»
16 years 6 hour ago
Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
Celina M. Herrera de Figueiredo, Guilherme Dias da...