999 search results - page 83 / 200 » Constraints in Non-Boolean Contexts |
172
click to vote
ISSTA
2009
ACM
16 years 25 days ago
2009
ACM
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
165
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
154
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
163
click to vote
CPAIOR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
166
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents...