Sciweavers

8838 search results - page 220 / 1768
» Generalizing Domain Theory
Sort
View
EPS
1998
Springer
15 years 9 months ago
Acquisition of General Adaptive Features by Evolution
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...
Dan Ashlock, John E. Mayfield
BMCBI
2007
105views more  BMCBI 2007»
15 years 5 months ago
Finding regulatory elements and regulatory motifs: a general probabilistic framework
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
Erik van Nimwegen
ICDT
2010
ACM
137views Database» more  ICDT 2010»
15 years 3 months ago
A Greedy Algorithm for Constructing a Low-Width Generalized Hypertree Decomposition
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
Kaoru Katayama, Tatsuro Okawara, Yuka Itou
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
16 years 5 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
BALT
2006
15 years 8 months ago
On Ontology, ontologies, Conceptualizations, Modeling Languages, and (Meta)Models
In philosophy, the term ontology has been used since the 17th century to refer both to a philosophical discipline (Ontology with a capital "O"), and as a domain-independe...
Giancarlo Guizzardi