Sciweavers

273 search results - page 39 / 55
» Electricity Markets: How Many, Where and When
Sort
View
AAAI
1994
13 years 9 months ago
Solution Reuse in Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
Gérard Verfaillie, Thomas Schiex
BMCBI
2007
168views more  BMCBI 2007»
13 years 7 months ago
Bayesian model-based inference of transcription factor activity
Background: In many approaches to the inference and modeling of regulatory interactions using microarray data, the expression of the gene coding for the transcription factor is co...
Simon Rogers, Raya Khanin, Mark Girolami
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey
TVLSI
2002
97views more  TVLSI 2002»
13 years 7 months ago
Techniques for energy-efficient communication pipeline design
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
Gang Qu, Miodrag Potkonjak
JAIR
2011
214views more  JAIR 2011»
12 years 10 months ago
Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mo...
Dmytro Korzhyk, Zhengyu Yin, Christopher Kiekintve...