|
Search the dblp DataBase
Jordi Planes:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Chu-Min Li, Felip Manyà, Jordi Planes
Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT. [Citation Graph (0, 0)][DBLP] AAAI, 2006, pp:- [Conf]
- Jordi Castellà-Roca, Josep Domingo-Ferrer, Jordi Herrera-Joancomartí, Jordi Planes
A Performance Comparison of Java Cards for Micropayment Implementation. [Citation Graph (0, 0)][DBLP] CARDIS, 2000, pp:19-38 [Conf]
- Chu Li, Felip Manyà, Jordi Planes
Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. [Citation Graph (0, 0)][DBLP] CP, 2005, pp:403-414 [Conf]
- Jordi Planes
Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. [Citation Graph (0, 0)][DBLP] CP, 2003, pp:991- [Conf]
- Teresa Alsinet, Felip Manyà, Jordi Planes
A Max-SAT Solver with Lazy Data Structures. [Citation Graph (0, 0)][DBLP] IBERAMIA, 2004, pp:334-342 [Conf]
- Josep Argelich, Xavier Domingo, Chu-Min Li, Felip Manyà, Jordi Planes
Towards Solving Many-Valued MaxSAT. [Citation Graph (0, 0)][DBLP] ISMVL, 2006, pp:26- [Conf]
- Teresa Alsinet, Felip Manyà, Jordi Planes
Improved Exact Solvers for Weighted Max-SAT. [Citation Graph (0, 0)][DBLP] SAT, 2005, pp:371-377 [Conf]
A Formal Model of Competence-Based Assessment. [Citation Graph (, )][DBLP]
Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation. [Citation Graph (, )][DBLP]
Algorithms for Maximum Satisfiability using Unsatisfiable Cores. [Citation Graph (, )][DBLP]
A MAX-SAT Algorithm Portfolio. [Citation Graph (, )][DBLP]
Generating Hard Instances for MaxSAT. [Citation Graph (, )][DBLP]
Algorithms for Weighted Boolean Optimization. [Citation Graph (, )][DBLP]
Exploiting Cycle Structures in Max-SAT. [Citation Graph (, )][DBLP]
On Using Unsatisfiability for Solving Maximum Satisfiability [Citation Graph (, )][DBLP]
Algorithms for Weighted Boolean Optimization [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|