Sciweavers

20294 search results - page 3895 / 4059
» Algorithmic Information Theory
Sort
View
BMCBI
2002
131views more  BMCBI 2002»
15 years 6 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
BMCBI
2002
133views more  BMCBI 2002»
15 years 6 months ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
AC
1998
Springer
15 years 5 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
15 years 5 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
ISCI
2002
130views more  ISCI 2002»
15 years 5 months ago
A study of object declustering strategies in parallel temporal object database systems
In a transaction-time temporal object database management system (TODBMS), updating an object creates a new version of the object, but the old version is still accessible. A TODBM...
Kjetil Nørvåg
« Prev « First page 3895 / 4059 Last » Next »