Sciweavers

1421 search results - page 198 / 285
» Satisfying KBO Constraints
Sort
View
KBSE
1997
IEEE
15 years 11 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...
ICTAI
1993
IEEE
15 years 11 months ago
Short Term Unit-Commitment Using Genetic Algorithms
Unit commitment is a complex decision-making process because of multiple constraints which must not be violated while nding the optimal or a near-optimal commitment schedule. This...
Dipankar Dasgupta, Douglas R. McGregor
ITC
1994
IEEE
151views Hardware» more  ITC 1994»
15 years 11 months ago
Automated Logic Synthesis of Random-Pattern-Testable Circuits
Previous approaches to designing random pattern testable circuits use post-synthesis test point insertion to eliminate random pattern resistant (r.p.r.) faults. The approach taken...
Nur A. Touba, Edward J. McCluskey
CONCUR
2007
Springer
15 years 10 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar
CP
2006
Springer
15 years 10 months ago
Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
Cédric Pralet, Thomas Schiex, Gérard...