Sciweavers

36 search results - page 6 / 8
» Abstract Branching for Quantified Formulas
Sort
View
CADE
2004
Springer
14 years 7 months ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
SECON
2010
IEEE
13 years 5 months ago
QoI-Aware Wireless Sensor Network Management for Dynamic Multi-Task Operations
Abstract--This paper considers the novel area of quality-ofinformation (QoI)-aware network management of multitasking wireless sensor networks (WSNs). Specifically, it provides an ...
Chi Harold Liu, Chatschik Bisdikian, Joel W. Branc...
JCB
1998
105views more  JCB 1998»
13 years 7 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
ICSOC
2010
Springer
13 years 5 months ago
Automatic Fragment Identification in Workflows Based on Sharing Analysis
In Service-Oriented Computing (SOC), fragmentation and merging of workflows are motivated by a number of concerns, among which we can cite design issues, performance, and privacy. ...
Dragan Ivanovic, Manuel Carro, Manuel V. Hermenegi...
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul