Sciweavers

3514 search results - page 575 / 703
» A search space
Sort
View
JCM
2007
131views more  JCM 2007»
13 years 10 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
GPEM
2002
95views more  GPEM 2002»
13 years 10 months ago
On Appropriate Adaptation Levels for the Learning of Gene Linkage
A number of algorithms have been proposed aimed at tackling the problem of learning "Gene Linkage" within the context of genetic optimisation, that is to say, the problem...
James Smith
DKE
1998
88views more  DKE 1998»
13 years 10 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng
KBSE
2010
IEEE
13 years 8 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
PVLDB
2010
122views more  PVLDB 2010»
13 years 8 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han