Sciweavers

1883 search results - page 285 / 377
» Ordered theta graphs
Sort
View
CIKM
2007
Springer
14 years 4 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
GECCO
2007
Springer
241views Optimization» more  GECCO 2007»
14 years 4 months ago
Binary ant algorithm
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
Carlos Fernandes, Agostinho C. Rosa, Vitorino Ramo...
IPPS
2005
IEEE
14 years 3 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
14 years 3 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
SPAA
1990
ACM
14 years 2 months ago
Optimal Cooperative Search in Fractional Cascaded Data Structures
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
Roberto Tamassia, Jeffrey Scott Vitter