Sciweavers

603 search results - page 56 / 121
» DFS-Tree Based Heuristic Search
Sort
View
CHES
2001
Springer
130views Cryptology» more  CHES 2001»
14 years 15 days ago
Generating Elliptic Curves of Prime Order
A variation of the Complex Multiplication (CM) method for generating elliptic curves of known order over finite fields is proposed. We give heuristics and timing statistics in th...
Erkay Savas, Thomas A. Schmidt, Çetin Kaya ...
EOR
2006
128views more  EOR 2006»
13 years 8 months ago
Scatter search for project scheduling with resource availability cost
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
Denise Sato Yamashita, Vinícius Amaral Arme...
TOPNOC
2008
13 years 7 months ago
Directed Unfolding of Petri Nets
The key to efficient on-the-fly reachability analysis based on unfolding is to focus the expansion of the finite prefix towards the desired marking. However, current unfolding stra...
Blai Bonet, Patrik Haslum, Sarah L. Hickmott, Sylv...
ESWS
2009
Springer
14 years 2 months ago
A Reasoning-Based Support Tool for Ontology Mapping Evaluation
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
Christian Meilicke, Heiner Stuckenschmidt, Ondrej ...
ECAI
2006
Springer
13 years 11 months ago
Last Conflict Based Reasoning
In this paper, we propose an approach to guide search to sources of conflicts. The principle is the following: the last variable involved in the last conflict is selected in priori...
Christophe Lecoutre, Lakhdar Sais, Sébastie...