Sciweavers

603 search results - page 39 / 121
» DFS-Tree Based Heuristic Search
Sort
View
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 11 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
RP
2009
Springer
121views Control Systems» more  RP 2009»
14 years 2 months ago
Games with Opacity Condition
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachab...
Bastien Maubert, Sophie Pinchinat
DEXA
1995
Springer
126views Database» more  DEXA 1995»
13 years 11 months ago
A Heuristic Approach for Optimization of Path Expressions
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
Cetin Ozkan, Asuman Dogac, Cem Evrendilek
FGCS
2008
95views more  FGCS 2008»
13 years 6 months ago
SemreX: Efficient search in a semantic overlay for literature retrieval
The World Wide Web is growing at such a pace that even the biggest centralized search engines are able to index only a small part of the available documents on the Internet. The d...
Hai Jin, Hanhua Chen
WEBI
2009
Springer
14 years 2 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova