Sciweavers

2398 search results - page 245 / 480
» Constraint Programming and Graph Algorithms
Sort
View
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
16 years 2 days ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
ICST
2009
IEEE
16 years 1 months ago
PKorat: Parallel Generation of Structurally Complex Test Inputs
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
Junaid Haroon Siddiqui, Sarfraz Khurshid
JFP
2008
97views more  JFP 2008»
15 years 5 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
ICFP
2010
ACM
15 years 7 months ago
Bidirectionalizing graph transformations
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...
Soichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hir...
COMAD
2009
15 years 7 months ago
Large Maximal Cliques Enumeration in Large Sparse Graphs
Identifying communities in social networks is a problem of great interest. One popular type of community is where every member of the community knows all others, which can be view...
Natwar Modani, Kuntal Dey