1998 search results - page 218 / 400 » Complexity of the Cover Polynomial |
169
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
210
click to vote
ALMOB
2006
15 years 6 months ago
2006
This editorial announces Algorithms for Molecular Biology, a new online open access journal published by BioMed Central. By launching the first open access journal on algorithmic ...
166
click to vote
JACM
2006
15 years 6 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
178
click to vote
HAPTICS
2007
IEEE
16 years 28 days ago
2007
IEEE
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
175
Voted
JELIA
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...