Sciweavers

1653 search results - page 327 / 331
» Computer science and game theory
Sort
View
AI
2010
Springer
13 years 7 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
BMCBI
2007
144views more  BMCBI 2007»
13 years 7 months ago
Robust regression for periodicity detection in non-uniformly sampled time-course gene expression data
Background: In practice many biological time series measurements, including gene microarrays, are conducted at time points that seem to be interesting in the biologist's opin...
Miika Ahdesmäki, Harri Lähdesmäki, ...
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 7 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
OCLC
2008
86views more  OCLC 2008»
13 years 7 months ago
Those who don't look don't find: disciplinary considerations in repository advocacy
Purpose of this paper By describing some of the often ignored aspects of repository advocacy, such as disciplinary differences and how these might affect the adoption of a particu...
Danny Kingsley
CCR
2000
96views more  CCR 2000»
13 years 7 months ago
Decentralized optimal traffic engineering in the internet
Distributed optimal traffic engineering in the presence of multiple paths has been found to be a difficult problem to solve. In this paper, we introduce a new approach in an attem...
Constantino M. Lagoa, Hao Che