2398 search results - page 263 / 480 » Constraint Programming and Graph Algorithms |
167
click to vote
COR
2010
15 years 6 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
137
click to vote
TACAS
2007
Springer
16 years 16 days ago
2007
Springer
We present JPF–SE, an extension to the Java PathFinder Model Checking framework (JPF) that enables the symbolic execution of Java programs. JPF–SE uses JPF to generate and expl...
148
click to vote
AAECC
2006
Springer
15 years 10 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
176
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
149
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...