36 search results - page 6 / 8 » Solving Satisfiability Problems on FPGAs using Experimental ... |
ASPDAC
2008
ACM
13 years 7 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
TSMC
2010
13 years 14 days ago
2010
Abstract--The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is...
ECCC
2007
13 years 5 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
JAIR
2007
13 years 5 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpli...
ATAL
2009
Springer
14 years 11 days ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...