599 search results - page 105 / 120 » The repeater tree construction problem |
135
click to vote
COMPUTER
2002
15 years 3 months ago
2002
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
136
click to vote
ALENEX
2007
15 years 5 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
132
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
140
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
141
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...