Sciweavers

2912 search results - page 572 / 583
» Logistic Model Trees
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
14 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 1 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
PPSN
1994
Springer
14 years 1 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob
SIGCOMM
1994
ACM
14 years 1 months ago
An Architecture for Wide-Area Multicast Routing
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and sende...
Stephen E. Deering, Deborah Estrin, Dino Farinacci...
AFRIGRAPH
2009
ACM
14 years 1 months ago
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
The generation of accurate Line of Sight (LOS) visibility information consumes significant resources in large scale synthetic environments such as many-on-many serious games and b...
Bernardt Duvenhage