×

zbMATH — the first resource for mathematics

Béjar, Ramón

Compute Distance To:
Author ID: bejar.ramon Recent zbMATH articles by "Béjar, Ramón"
Published as: Bejar, Ramon; Béjar, R.; Béjar, Ramon; Béjar, Ramón; Béjar, Rámon
Documents Indexed: 16 Publications since 1999

Publications by Year

Citations contained in zbMATH

10 Publications have been cited 27 times in 21 Documents Cited by Year
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics. Zbl 1354.68243
Alsinet, Teresa; Béjar, Ramón; Godo, Lluís; Guitart, Francesc
4
2016
Sensor networks and distributed CSP: communication, computation and complexity. Zbl 1132.68688
Béjar, Ramón; Domshlak, Carmel; Fernández, Cèsar; Gomes, Carla; Krishnamachari, Bhaskar; Selman, Bart; Valls, Magda
4
2005
Critical density thresholds in distributed wireless networks. Zbl 1377.94005
Krishnamachari, Bhaskar; Wicker, Stephen B.; Béjar, Rámon; Pearlman, Marc
4
2003
Solving combinatorial problems with regular local search algorithms. Zbl 0944.68166
Béjar, Ramón; Manyà, Felip
4
1999
Comparison of systematic and locals search algorithms for regular CNF formulas. Zbl 0935.68094
Béjar, Ramón; Manyà, Felip
3
1999
Weighted argumentation for analysis of discussions in Twitter. Zbl 1422.91606
Alsinet, Teresa; Argelich, Josep; Béjar, Ramón; Fernández, Cèsar; Mateu, Carles; Planes, Jordi
2
2017
Regular-SAT: A many-valued approach to solving combinatorial problems. Zbl 1121.68104
Béjar, Ramón; Manyà, Felip; Cabiscol, Alba; Fernàndez, Cèsar; Gomes, Carla
2
2007
Capturing structure with satisfiability. Zbl 1067.68535
Béjar, Ramón; Cabiscol, Alba; Fernàndez, Cèsar; Manyà, Felip; Gomes, Carla
2
2001
On the hardness of solving edge matching puzzles as SAT or CSP problems. Zbl 1310.05055
Ansótegui, Carlos; Béjar, Ramón; Fernández, Cèsar; Mateu, Carles
1
2013
Minimal and redundant SAT encodings for the all-interval-series problem. Zbl 1028.68627
Alsinet, T.; Béjar, R.; Cabiscol, A.; Fernàndez, C.; Manyà, F.
1
2002
Weighted argumentation for analysis of discussions in Twitter. Zbl 1422.91606
Alsinet, Teresa; Argelich, Josep; Béjar, Ramón; Fernández, Cèsar; Mateu, Carles; Planes, Jordi
2
2017
RP-DeLP: a weighted defeasible argumentation framework based on a recursive semantics. Zbl 1354.68243
Alsinet, Teresa; Béjar, Ramón; Godo, Lluís; Guitart, Francesc
4
2016
On the hardness of solving edge matching puzzles as SAT or CSP problems. Zbl 1310.05055
Ansótegui, Carlos; Béjar, Ramón; Fernández, Cèsar; Mateu, Carles
1
2013
Regular-SAT: A many-valued approach to solving combinatorial problems. Zbl 1121.68104
Béjar, Ramón; Manyà, Felip; Cabiscol, Alba; Fernàndez, Cèsar; Gomes, Carla
2
2007
Sensor networks and distributed CSP: communication, computation and complexity. Zbl 1132.68688
Béjar, Ramón; Domshlak, Carmel; Fernández, Cèsar; Gomes, Carla; Krishnamachari, Bhaskar; Selman, Bart; Valls, Magda
4
2005
Critical density thresholds in distributed wireless networks. Zbl 1377.94005
Krishnamachari, Bhaskar; Wicker, Stephen B.; Béjar, Rámon; Pearlman, Marc
4
2003
Minimal and redundant SAT encodings for the all-interval-series problem. Zbl 1028.68627
Alsinet, T.; Béjar, R.; Cabiscol, A.; Fernàndez, C.; Manyà, F.
1
2002
Capturing structure with satisfiability. Zbl 1067.68535
Béjar, Ramón; Cabiscol, Alba; Fernàndez, Cèsar; Manyà, Felip; Gomes, Carla
2
2001
Solving combinatorial problems with regular local search algorithms. Zbl 0944.68166
Béjar, Ramón; Manyà, Felip
4
1999
Comparison of systematic and locals search algorithms for regular CNF formulas. Zbl 0935.68094
Béjar, Ramón; Manyà, Felip
3
1999

Citations by Year