4066 search results - page 282 / 814 » Almost Complete Sets |
186
click to vote
WOB
2004
15 years 8 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...
156
click to vote
COLING
1992
15 years 7 months ago
1992
No one has come up with a completely satisfactory set of deep cases relations (or thematic relations). The underlying reason is that any finite set of case relations can capture o...
147
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
199
click to vote
CSJM
2008
15 years 6 months ago
2008
A hybrid network of evolutionary processors (an HNEP) is a graph where each node is associated with an evolutionary processor (a special rewriting system), a set of words, an inpu...
181
click to vote
JAIR
2006
15 years 6 months ago
2006
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...