1568 search results - page 242 / 314 » The problem of examination questions in algorithmics |
103
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: The main two sorts of automatic gene annotation frameworks are ab initio and alignment-based, the latter splitting into two sub-groups. The first group is used for int...
139
click to vote
CCGRID
2003
IEEE
15 years 9 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
162
click to vote
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
125
click to vote
AINA
2010
IEEE
15 years 9 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
145
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Typically,cell parameterssuch as the pin-to-pinintrinsicdelays, load-dependentcoe cients,andinputpin capacitanceshavedifferent values for rising and falling signals. The performan...