Sciweavers

2398 search results - page 316 / 480
» Constraint Programming and Graph Algorithms
Sort
View
IPPS
2009
IEEE
16 years 24 days ago
Implementing and evaluating multithreaded triad census algorithms on the Cray XMT
Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysi...
George Chin Jr., Andrès Márquez, Sut...
198
Voted
SAC
2006
ACM
15 years 6 months ago
Efficient interactive configuration of unbounded modular systems
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
Erik Roland van der Meer, Andrzej Wasowski, Henrik...
CP
2009
Springer
16 years 6 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
Arthur Choi, Trevor Standley, Adnan Darwiche
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
16 years 1 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
156
Voted
PEPM
1994
ACM
15 years 10 months ago
Binding-Time Analysis for Standard ML
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
Lars Birkedal, Morten Welinder