Sciweavers

58 search results - page 12 / 12
» Using strongly typed networking to architect for tussle
Sort
View
PODC
2006
ACM
13 years 11 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ATAL
2006
Springer
13 years 9 months ago
Hierarchical planning in BDI agent programming languages: a formal approach
This paper provides a general mechanism and a solid theoretical basis for performing planning within Belief-Desire-Intention (BDI) agents. BDI agent systems have emerged as one of...
Sebastian Sardiña, Lavindra de Silva, Lin P...
BMCBI
2005
127views more  BMCBI 2005»
13 years 5 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin