Sciweavers

4488 search results - page 789 / 898
» Properties of NP-Complete Sets
Sort
View
WSC
2000
13 years 9 months ago
Mathematical programming models of discrete event system dynamics
Analytical models for the dynamics of some discrete event systems are introduced where the system trajectories are solutions to linear and mixed-integer programs. 1 BACKGROUND The...
Lee Schruben
AAAI
1994
13 years 9 months ago
Incremental Recompilation of Knowledge
d Abstract) Goran Gogic l, Christos H. Papadimitriou', and Martha Sideri2 : Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn c...
Goran Gogic, Christos H. Papadimitriou, Martha Sid...
ATAL
2010
Springer
13 years 9 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
AI
2010
Springer
13 years 8 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
2010
111views more  BMCBI 2010»
13 years 8 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
Hedda Høvik, Tsute Chen