Sciweavers

1402 search results - page 126 / 281
» Sparse-Memory Graph Search
Sort
View
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 8 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
AAAI
2007
15 years 13 days ago
Discovering Near Symmetry in Graphs
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...
Maria Fox, Derek Long, Julie Porteous
76
Voted
ICDCS
2007
IEEE
15 years 4 months ago
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. ...
Hasan Guclu, Murat Yuksel
GECCO
2005
Springer
146views Optimization» more  GECCO 2005»
15 years 3 months ago
An empirical study of the robustness of two module clustering fitness functions
Two of the attractions of search-based software engineering (SBSE) derive from the nature of the fitness functions used to guide the search. These have proved to be highly robust...
Mark Harman, Stephen Swift, Kiarash Mahdavi
AMAI
2004
Springer
15 years 3 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate