Sciweavers

267 search results - page 4 / 54
» Generating all maximal models of a Boolean expression
Sort
View
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
14 years 5 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
ICST
2008
IEEE
14 years 4 days ago
Quality of Automatically Generated Test Cases based on OCL Expressions
In this paper, we deal with coverage criteria for boundary testing. We focus on the automatic generation of boundary tests based on OCL expressions and evaluate the quality of the...
Stephan Weißleder, Bernd-Holger Schlingloff
BMCBI
2007
197views more  BMCBI 2007»
13 years 5 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
JAR
2011
112views more  JAR 2011»
13 years 19 days 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...
CGF
2010
132views more  CGF 2010»
13 years 5 months ago
Hybrid Booleans
In this paper we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and effi...
Darko Pavic, Marcel Campen, Leif Kobbelt