Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,422,683 papers from all fields of science
Search
Sign In
Create Free Account
GRASP (SAT solver)
Known as:
Grasp (disambiguation)
GRASP is a well known SAT instance solver. It was developed by João Marques Silva, a Portuguese computer science researcher. It stands for Generic…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Boolean satisfiability problem
DPLL algorithm
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A MULTICRITERIA PERMUTATION FLOWSHOP SCHEDULING PROBLEM WITH SETUP TIMES
M.Saravanan
,
S. Vijayakumar
,
R.Srinivasan
2014
Corpus ID: 212533447
: The permutation flow shop scheduling problem has been completely concentrated on in late decades, both from single objective…
Expand
2013
2013
Independent contact regions for local force closure grasps
H. Krüger
,
A.F. van der Stappen
IEEE International Conference on Robotics and…
2013
Corpus ID: 26650813
2012
2012
Multiple Sink and Relay Placement in Wireless Sensor Networks
Lanny Sitanayah
,
Kenneth N. Brown
,
C. Sreenan
2012
Corpus ID: 7473275
Wireless sensor networks are subject to failures. Deployment planning should ensure that when a sink or sensor node fails, the…
Expand
2010
2010
H-GRASP:advanced GRASP-based hybrid SAT solver
Chen Jian-hui
2010
Corpus ID: 63426074
In order to improve the limitations of GRASP,this paper proposed a new hybrid algorithm(H-GRASP),which could resolve the problem…
Expand
1999
1999
Just DSP
D. Grover
IEEE Signal Processing Magazine
1999
Corpus ID: 39855546
iiiorc sophistication anc l insight. Good cxmiplcs ofthis approach ;ire coiiimuiiication (the hlocl i diagram ofthc l i i i i…
Expand