Sciweavers

2725 search results - page 77 / 545
» Constraint Solving for Interpolation
Sort
View
102
Voted
DAC
2009
ACM
16 years 1 months ago
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
Himanshu Jain, Edmund M. Clarke
CEC
2007
IEEE
15 years 7 months ago
An investigation into dynamic problem solving in a hybrid evolutionary market-based multi-agent system
— Static resources allocation problems have been widely studied. More recently some of this attention has changed to focus on dynamic problems, where problem specifications, con...
D. J. Cornforth
112
Voted
WSC
2007
15 years 3 months ago
Stochastic rollout and justification to solve the resource-constrained project scheduling problem
The key question addressed by the resource-constrained project scheduling problem (RCPSP) is to determine the start times for each activity such that precedence and resource const...
Ningxiong Xu, Linda K. Nozick, Orr Bernstein, Dean...
ATMOS
2007
129views Optimization» more  ATMOS 2007»
15 years 2 months ago
Solving a Real-World Train Unit Assignment Problem
We face a real-world train unit assignment problem for an operator running trains in a regional area. Given a set of timetabled train trips, each with a required number of passenge...
Valentina Cacchiani, Alberto Caprara, Paolo Toth
DAM
2000
137views more  DAM 2000»
15 years 17 days ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...