Sciweavers

738 search results - page 123 / 148
» Formal Methods: for All or for Chosen
Sort
View
JAR
2011
112views more  JAR 2011»
13 years 3 months ago
A Framework for Certified Boolean Branch-and-Bound Optimization
We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
SIAMAM
2011
12 years 11 months ago
On the Optimal Receiver Activation Function for Distance-Based Geographic Transmissions
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
Murali Rao, Tathagata D. Goswami, Joseph Glover, J...
SIGSOFT
2007
ACM
14 years 9 months ago
Quantitative verification: models techniques and tools
Automated verification is a technique for establishing if certain properties, usually expressed in temporal logic, hold for a system model. The model can be defined using a high-l...
Marta Z. Kwiatkowska
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
14 years 9 months ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
BMCBI
2007
114views more  BMCBI 2007»
13 years 8 months ago
Mining and state-space modeling and verification of sub-networks from large-scale biomolecular networks
Background: Biomolecular networks dynamically respond to stimuli and implement cellular function. Understanding these dynamic changes is the key challenge for cell biologists. As ...
Xiaohua Hu, Fang-Xiang Wu