36 search results - page 4 / 8 » Solving Satisfiability Problems on FPGAs using Experimental ... |
CP
2010
Springer
13 years 4 months ago
2010
Springer
We present two heuristics based on constraint technology that solve the problem of generating air traffic management contingency plans, which are used in the case of a catastrophic...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
The paper explores several ways to improve the speed and capacity of combinational equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use simulat...
ECAI
1998
Springer
13 years 10 months ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
GLOBECOM
2006
IEEE
14 years 1 days ago
2006
IEEE
Abstract— Many emerging applications for peer to peer overlays may require nodes to satisfy strict timing deadlines to access a replica of a given object. This includes multimedi...
FLAIRS
2008
13 years 8 months ago
2008
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...