Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,180,266 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.
2013
2013
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic
A. Plastino
,
Hugo Barbalho
,
Luis Filipe M. Santos
,
Richard Fuchshuber
,
S. Martins
Journal of Heuristics
2013
Corpus ID: 22292445
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for…
Expand
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
2012
2012
GRASP-BSMA: A fast algorithm for delay constrained multicast routing
G. Feng
IEEE International Conference on Communications…
2012
Corpus ID: 5183963
Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Many…
Expand
2012
2012
Social and dynamic graph-based scalable routing protocol in a DTN network
F. Rango
,
Filippo Monteverdi
International Symposium on Performance Evaluation…
2012
Corpus ID: 6976814
In this paper we consider the DTN routing problem in networks where the links between nodes are not stable, but tend to change…
Expand
2011
2011
A hybrid ACO-GRASP algorithm for clustering analysis
Yannis Marinakis
,
Magdalene Marinaki
,
M. Doumpos
,
N. Matsatsinis
,
C. Zopounidis
Annals of Operations Research
2011
Corpus ID: 5440894
Cluster analysis is an important tool for data exploration and it has been applied in a wide variety of fields like engineering…
Expand
2009
2009
Multiple phase neighborhood Search—GRASP based on Lagrangean relaxation, random backtracking Lin–Kernighan and path relinking for the TSP
Yannis Marinakis
,
A. Migdalas
,
P. Pardalos
Journal of combinatorial optimization
2009
Corpus ID: 36393032
Abstract In this paper, a new modified version of Greedy Randomized Adaptive Search Procedure (GRASP), called Multiple Phase…
Expand
2009
2009
A hybrid data mining metaheuristic for the p‐median problem
A. Plastino
,
Richard Fuchshuber
,
S. Martins
,
A. Freitas
,
S. Salhi
Statistical analysis and data mining
2009
Corpus ID: 15928265
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for…
Expand
Review
2008
Review
2008
Applications of the DM-GRASP heuristic: a survey
Luis Filipe M. Santos
,
S. Martins
,
A. Plastino
International Transactions in Operational…
2008
Corpus ID: 29144944
Recent research has shown that the hybridization of metaheuristics is a powerful mechanism to develop more robust and efficient…
Expand
2007
2007
A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
B. Shahul
,
Hamid Khan
,
G. Prabhaharan
,
P. Asokan
International Journal of Computational…
2007
Corpus ID: 27259094
In this paper we address the problem of minimizing the weighted sum of makespan and maximum tardiness in an m-machine flow shop…
Expand
Highly Cited
2000
Highly Cited
2000
Computing 3-D optimal form-closure grasps
Dan Ding
,
Yun-hui Liu
,
Shuguo Wang
Proceedings ICRA. Millennium Conference. IEEE…
2000
Corpus ID: 12308071
We address the problem of computing optimal fingertip locations yielding n-finger form-closure grasps of polyhedral objects…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE