Ana Paula Nunes Gomes Tomás


AuthID: R-000-1C1

Publicações Confirmadas: 36



11
TÍTULO: Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: Lower and upper bounds on the number of pieces
AUTORES: Bajuelos, AL ; Tomas, AP ; Marques, F;
PUBLICAÇÃO: 2004, FONTE: International Conference on Computational Science and Its Applications (ICSSA 2004) in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, VOLUME: 3045
INDEXADO EM: Scopus WOS DBLP CrossRef: 4
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
12
TÍTULO: Quadratic-time linear-space algorithms for generating orthogonal polygons with a given number of vertices
AUTORES: Tomas, AP ; Bajuelos, AL ;
PUBLICAÇÃO: 2004, FONTE: International Conference on Computational Science and Its Applications (ICSSA 2004) in COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 3, VOLUME: 3045
INDEXADO EM: Scopus WOS DBLP CrossRef: 7
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
13
TÍTULO: A CLP-based tool for computer aided generation and solving of maths exercises
AUTORES: Tomas, AP ; Leal, JP ;
PUBLICAÇÃO: 2003, FONTE: 5th International Symposium on Practical Aspects of Declarative Languages in PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PROCEEDINGS, VOLUME: 2562
INDEXADO EM: Scopus WOS DBLP CrossRef: 9
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
14
TÍTULO: Approximation algorithms to minimum vertex cover problems on polygons and terrains
AUTORES: Tomas, AP ; Bajuelos, AL ; Marques, F;
PUBLICAÇÃO: 2003, FONTE: International Conference on Computational Science (ICCS 2003) in COMPUTATIONAL SCIENCE - ICCS 2003, PT I, PROCEEDINGS, VOLUME: 2657
INDEXADO EM: Scopus WOS DBLP CrossRef: 5
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
15
TÍTULO: Generating random orthogonal polygons  Full Text
AUTORES: Tomas, AP ; Bajuelos, AL ;
PUBLICAÇÃO: 2003, FONTE: 10th Conference of the Spanish-Association-for-Artificial-Intelligence (CAEPIA 2003)/5th Conference on Technology Transfer (TTIA 2003) in CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, VOLUME: 3040
INDEXADO EM: Scopus WOS DBLP CrossRef: 9
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
16
TÍTULO: Solving Optimal Location of Traffic Count Posts in CLP(FD) PDF
AUTORES: Ana Paula Tomás ;
PUBLICAÇÃO: 2002, FONTE: AGP 2002: Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE, Madrid, Spain, September 16-18, 2002.
INDEXADO EM: DBLP
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
17
TÍTULO: Solving Optimal Location of Traffic Counting Points at Urban Intersections in CLP(FD)
AUTORES: Ana Paula Tomás ;
PUBLICAÇÃO: 2002, FONTE: MICAI 2002: Advances in Artificial Intelligence, Second Mexican International Conference on Artificial Intelligence, Merida, Yucatan, Mexico, April 22-26, 2002, Proceedings, VOLUME: 2313
INDEXADO EM: DBLP CrossRef
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
18
TÍTULO: Solving optimal location of traffic counting points at urban intersections in CLP(FD)
AUTORES: Tomás, AP ;
PUBLICAÇÃO: 2002, FONTE: 2nd Mexican International Conference on Artificial Intelligence, MICAI 2002 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 2313
INDEXADO EM: Scopus
NO MEU: ORCID | CIÊNCIAVITAE
19
TÍTULO: Using Constraint Logic Programming to Generate Drills in Mathematics PDF
AUTORES: Ana Paula Tomás ; José Paulo Leal ; Pedro Vasconcelos;
PUBLICAÇÃO: 2002, FONTE: AGP 2002: Proceedings of the Joint Conference on Declarative Programming, APPIA-GULP-PRODE, Madrid, Spain, September 16-18, 2002.
INDEXADO EM: DBLP
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
20
TÍTULO: An Algorithm for Solving Systems of Linear Diophantine Equations in Naturals
AUTORES: Ana Paula Tomás ; Miguel Filgueiras;
PUBLICAÇÃO: 1997, FONTE: 8th Portuguese Conference on Artificial Intelligence, EPIA 1997 in Progress in Artificial Intelligence, 8th Portuguese Conference on Artificial Intelligence, EPIA '97, Coimbra, Portugal, October 6-9, 1997, Proceedings, VOLUME: 1323
INDEXADO EM: Scopus DBLP CrossRef: 4
NO MEU: ORCID | DBLP | CIÊNCIAVITAE
Página 2 de 4. Total de resultados: 36.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2025 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service