148 search results - page 29 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
BMCBI
2006
13 years 6 months ago
2006
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
IPPS
2008
IEEE
14 years 17 days ago
2008
IEEE
Buffered crossbar switches are a special type of combined input-output queued switches with each crosspoint of the crossbar having small on-chip buffers. The introduction of cross...
PLDI
1997
ACM
13 years 10 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...
IPSN
2009
Springer
14 years 29 days ago
2009
Springer
We consider the problem of monitoring spatial phenomena, such as road speeds on a highway, using wireless sensors with limited battery life. A central question is to decide where ...
CP
2004
Springer
13 years 11 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...