Sciweavers

1099 search results - page 166 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
CAD
1998
Springer
15 years 3 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz
ESANN
2008
15 years 5 months ago
Learning to play Tetris applying reinforcement learning methods
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
Alexander Groß, Jan Friedland, Friedhelm Sch...
ICALP
1994
Springer
15 years 8 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
CORR
2004
Springer
146views Education» more  CORR 2004»
15 years 4 months ago
ANTIDS: Self-Organized Ant-based Clustering Model for Intrusion Detection System
: Security of computers and the networks that connect them is increasingly becoming of great significance. Computer security is defined as the protection of computing systems again...
Vitorino Ramos, Ajith Abraham
197
Voted
BMCBI
2011
14 years 11 months ago
Bio: : Phylo - phyloinformatic analysis using Perl
Background: Phyloinformatic analyses involve large amounts of data and metadata of complex structure. Collecting, processing, analyzing, visualizing and summarizing these data and...
Rutger A. Vos, Jason Caravas, Klaas Hartmann, Mark...