Sciweavers

2412 search results - page 167 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
136
Voted
STACS
2010
Springer
15 years 10 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
127
Voted
BMCBI
2007
108views more  BMCBI 2007»
15 years 3 months ago
Computer-aided identification of polymorphism sets diagnostic for groups of bacterial and viral genetic variants
Background: Single nucleotide polymorphisms (SNPs) and genes that exhibit presence/absence variation have provided informative marker sets for bacterial and viral genotyping. Iden...
Erin P. Price, John Inman-Bamber, Venugopal Thiruv...
ENTCS
2007
119views more  ENTCS 2007»
15 years 3 months ago
PML: Toward a High-Level Formal Language for Biological Systems
Documentation of knowledge about biological pathways is often informal and vague, making it difficult to efficiently synthesize the work of others into a holistic understanding of...
Bor-Yuh Evan Chang, Manu Sridharan
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 1 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
114
Voted
WETICE
1996
IEEE
15 years 7 months ago
Independent validation of specifications: a coordination headache
Large, complex projects face significant barriers to coordination and communication due to continuous, rapid changes during a project's lifecycle. Such changes must be tracke...
Steve M. Easterbrook, John R. Callahan