Sciweavers

1051 search results - page 182 / 211
» Foundations of Constraint Satisfaction
Sort
View
DATE
2007
IEEE
85views Hardware» more  DATE 2007»
14 years 4 months ago
QuteSAT: a robust circuit-based SAT solver for complex circuit structure
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
Chi-An Wu, Ting-Hao Lin, Chih-Chun Lee, Chung-Yang...
ICSM
2006
IEEE
14 years 3 months ago
Source-Level Linkage: Adding Semantic Information to C++ Fact-bases
Facts extracted from source code have been used to support a variety of software engineering activities, ranging from architectural understanding, through detection of design patt...
Daqing Hou, H. James Hoover
FTDCS
2003
IEEE
14 years 3 months ago
Dynamic Component Composition for Functionality Adaptation in Pervasive Environments
With the increasing prevalence of mobile devices, computing is being carried out on devices with varied resource constraints and is afflicted by constant changes in run-time conte...
Nalini Moti Belaramani, Cho-Li Wang, Francis C. M....
CN
2006
145views more  CN 2006»
13 years 10 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...
JAIR
2008
98views more  JAIR 2008»
13 years 9 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...