4117 search results - page 643 / 824 » On the Satisfiability of Complex Constraints |
168
click to vote
CSB
2005
IEEE
16 years 7 days ago
2005
IEEE
Protein Data Integration approaches at the moment considers data sources as data repositories, but not as applications; which in turn may embody complex interactions with other da...
174
click to vote
SMI
2005
IEEE
16 years 6 days ago
2005
IEEE
Recent research on point-based surface representations suggests that point sets may be a viable alternative to parametric surface representations in applications where the topolog...
156
click to vote
CP
2005
Springer
16 years 4 days ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
182
click to vote
JIT
2005
Springer
16 years 3 days ago
2005
Springer
: Complex software systems, like operating systems and middleware, have to cope with a broad range of requirements as well as strict resource constraints. Family-based software dev...
133
click to vote
HICSS
2003
IEEE
15 years 12 months ago
2003
IEEE
In this paper, we tackle the problem of topology formation in Bluetooth Wireless Personal Area Networks (BTWPANs). We first overview and extend a previously proposed centralized ...