Sciweavers

2084 search results - page 274 / 417
» Set Constraints in Logic Programming
Sort
View
COMPSAC
2003
IEEE
14 years 1 months ago
Automated Metamorphic Testing
Usual techniques for automatic test data generation are based on the assumption that a complete oracle will be available during the testing process. However, there are programs fo...
Arnaud Gotlieb, Bernard Botella
AGP
1999
IEEE
14 years 17 days ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
ECOOP
2008
Springer
13 years 10 months ago
An Extensible State Machine Pattern for Interactive Applications
Abstract. The state design pattern is the standard object-oriented programming idiom for implementing the state machine logic of interactive applications. While this pattern provid...
Brian Chin, Todd D. Millstein
ICML
2009
IEEE
14 years 9 months ago
Partial order embedding with multiple kernels
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
Brian McFee, Gert R. G. Lanckriet
CPAIOR
2009
Springer
14 years 2 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub