The following pages link to Ramón Béjar (Q505968):
Displaying 17 items.
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
- The Sudoku completion problem with rectangular hole pattern is NP-complete (Q713152) (← links)
- A probabilistic author-centered model for twitter discussions (Q2107397) (← links)
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- (Q2741541) (← links)
- RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics (Q2957949) (← links)
- Critical Density Thresholds in Distributed Wireless Networks (Q3448755) (← links)
- (Q4262997) (← links)
- (Q4438827) (← links)
- (Q4475627) (← links)
- Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers (Q4589085) (← links)
- (Q4938415) (← links)
- (Q5393488) (← links)
